pith. sign in

hub Mixed citations

TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems

Mixed citation behavior. Most common role is method (64%).

53 Pith papers citing it
Method 64% of classified citations
abstract

TensorFlow is an interface for expressing machine learning algorithms, and an implementation for executing such algorithms. A computation expressed using TensorFlow can be executed with little or no change on a wide variety of heterogeneous systems, ranging from mobile devices such as phones and tablets up to large-scale distributed systems of hundreds of machines and thousands of computational devices such as GPU cards. The system is flexible and can be used to express a wide variety of algorithms, including training and inference algorithms for deep neural network models, and it has been used for conducting research and for deploying machine learning systems into production across more than a dozen areas of computer science and other fields, including speech recognition, computer vision, robotics, information retrieval, natural language processing, geographic information extraction, and computational drug discovery. This paper describes the TensorFlow interface and an implementation of that interface that we have built at Google. The TensorFlow API and a reference implementation were released as an open-source package under the Apache 2.0 license in November, 2015 and are available at www.tensorflow.org.

hub tools

citation-role summary

method 7 background 3 other 1

citation-polarity summary

representative citing papers

Deep Variational Information Bottleneck

cs.LG · 2016-12-01 · unverdicted · novelty 8.0

Deep VIB is a neural-network parameterization of the information bottleneck objective trained via variational inference and the reparameterization trick, yielding improved generalization and adversarial robustness.

Density estimation using Real NVP

cs.LG · 2016-05-27 · accept · novelty 8.0

Real NVP uses affine coupling layers to create invertible transformations that support exact density estimation, sampling, and latent inference without approximations.

Deep reinforcement learning from human preferences

stat.ML · 2017-06-12 · accept · novelty 7.0

Reinforcement learning agents solve complex tasks without access to the reward function by training a reward predictor from human comparisons of trajectory segments, requiring feedback on less than 1% of interactions.

SMART: A Spectral Transfer Approach to Multi-Task Learning

cs.LG · 2026-04-22 · unverdicted · novelty 7.0

SMART transfers knowledge in multi-task linear regression via spectral subspace similarity assumptions, achieving near-minimax Frobenius error rates while requiring only a fitted source model.

The Kinetics Human Action Video Dataset

cs.CV · 2017-05-19 · accept · novelty 7.0

Kinetics is a new video dataset of 400 human actions with over 160000 ten-second clips collected from YouTube, accompanied by baseline action-classification results from neural networks.

HyperNetworks

cs.LG · 2016-09-27 · unverdicted · novelty 7.0

Hypernetworks generate weights for a main network, allowing LSTMs to use non-shared weights and achieve near state-of-the-art results on sequence modeling tasks while using fewer parameters overall.

Image reconstruction with the JWST Interferometer

astro-ph.IM · 2025-10-13 · unverdicted · novelty 6.0

Dorito enables diffraction-limited image reconstruction from JWST AMI observations by deconvolving images or Fourier observables using maximum entropy and total variation regularization.

ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution

cs.CL · 2025-09-17 · unverdicted · novelty 6.0

ShinkaEvolve improves sample efficiency in LLM-driven program evolution via parent sampling, code novelty rejection-sampling, and bandit LLM ensemble selection, achieving new SOTA circle packing with 150 samples and gains on math reasoning and competitive programming tasks.

On Model-Based Clustering With Entropic Optimal Transport

stat.ME · 2026-05-05 · unverdicted · novelty 6.0

Entropic optimal transport yields a clustering loss with the same global optimum as log-likelihood but a better-behaved optimization surface, outperforming standard EM in experiments.

citing papers explorer

Showing 50 of 53 citing papers.