Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- California Institute of TechnologyUS2.6k papers
- Massachusetts Institute of TechnologyUS2.2k papers
- Centre National de la Recherche ScientifiqueFR2.2k papers
- University of California, Santa BarbaraUS2.1k papers
- The Ohio State UniversityUS2k papers
- University of California, Los AngelesUS2k papers
- Princeton UniversityUS1.9k papers
- University of Wisconsin–MadisonUS1.9k papers
- Johns Hopkins UniversityUS1.8k papers
- University of Colorado BoulderUS1.8k papers
- University of California, RiversideUS1.7k papers
- Purdue University West LafayetteUS1.7k papers
17 papers · 2 filters
On Communication Complexity of Classification Problems
Daniel M. Kane, Roi Livni, Shay Moran +1
This work studies distributed learning in the spirit of Yao's model of communication complexity: consider a two-party setting, where each of the players gets a list of labelled exa…
Variational Inference of Disentangled Latent Concepts from Unlabeled Observations
Abhishek Kumar, Prasanna Sattigeri, Avinash Balakrishnan
Disentangled representations, where the higher level data generative factors are reflected in disjoint latent dimensions, offer several benefits such as ease of deriving invariant…
Effective sketching methods for value function approximation
Yangchen Pan, Erfan Sadeqi Azer, Martha White
High-dimensional representations, such as radial basis function networks or tile coding, are common choices for policy evaluation in reinforcement learning. Learning with such high…
Composition Properties of Inferential Privacy for Time-Series Data
Shuang Song, Kamalika Chaudhuri
With the proliferation of mobile devices and the internet of things, developing principled solutions for privacy in time series applications has become increasingly important. Whil…
Tensor Contraction Layers for Parsimonious Deep Nets
Jean Kossaifi, Aran Khanna, Zachary C. Lipton +2
Tensors offer a natural representation for many kinds of data frequently encountered in machine learning. Images, for example, are naturally represented as third order tensors, whe…
A Design Methodology for Efficient Implementation of Deconvolutional Neural Networks on an FPGA
Xinyu Zhang, Srinjoy Das, Ojash Neopane +1
In recent years deep learning algorithms have shown extremely high performance on machine learning tasks such as image classification and speech recognition. In support of such app…
Semantically Decomposing the Latent Spaces of Generative Adversarial Networks
Chris Donahue, Zachary C. Lipton, Akshay Balsubramani +1
We propose a new algorithm for training generative adversarial networks that jointly learns latent codes for both identities (e.g. individual humans) and observations (e.g. specifi…
Federated Tensor Factorization for Computational Phenotyping
Yejin Kim, Jimeng Sun, Hwanjo Yu +1
Tensor factorization models offer an effective approach to convert massive electronic health records into meaningful clinical concepts (phenotypes) for data analysis. These models…
Nonnegative/binary matrix factorization with a D-Wave quantum annealer
Daniel O'Malley, Velimir V. Vesselinov, Boian S. Alexandrov +1
D-Wave quantum annealers represent a novel computational architecture and have attracted significant interest, but have been used for few real-world computations. Machine learning…
A Dual-Stage Attention-Based Recurrent Neural Network for Time Series Prediction
Yao Qin, Dongjin Song, Haifeng Chen +3
The Nonlinear autoregressive exogenous (NARX) model, which predicts the current value of a time series based upon its previous values as well as the current and past values of mult…
Dance Dance Convolution
Chris Donahue, Zachary C. Lipton, Julian McAuley
Dance Dance Revolution (DDR) is a popular rhythm-based video game. Players perform steps on a dance platform in synchronization with music as directed by on-screen step charts. Whi…
A GAMP Based Low Complexity Sparse Bayesian Learning Algorithm
Maher Al-Shoukairi, Philip Schniter, Bhaskar D. Rao
In this paper, we present an algorithm for the sparse signal recovery problem that incorporates damped Gaussian generalized approximate message passing (GGAMP) into Expectation-Max…
Being Robust (in High Dimensions) Can Be Practical
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane +3
Robust estimation is much more challenging in high dimensions than it is in one dimension: Most techniques either lead to intractable optimization problems or estimators that can t…
Precise Recovery of Latent Vectors from Generative Adversarial Networks
Zachary C. Lipton, Subarna Tripathi
Generative adversarial networks (GANs) transform latent vectors into visually plausible images. It is generally thought that the original GAN formulation gives no out-of-the-box me…
Spatial Filtering for EEG-Based Regression Problems in Brain-Computer Interface (BCI)
Dongrui Wu, Jung-Tai King, Chun-Hsiang Chuang +2
Electroencephalogram (EEG) signals are frequently used in brain-computer interfaces (BCIs), but they are easily contaminated by artifacts and noises, so preprocessing must be done…
Tuple-oriented Compression for Large-scale Mini-batch Stochastic Gradient Descent
Fengan Li, Lingjiao Chen, Yijing Zeng +4
Data compression is a popular technique for improving the efficiency of data processing workloads such as SQL queries and more recently, machine learning (ML) with classical batch…
Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces
Songbai Yan, Chicheng Zhang
It has been a long-standing problem to efficiently learn a halfspace using as few labels as possible in the presence of noise. In this work, we propose an efficient Perceptron-base…