output
19922026
Showing 2018 · cs.LGShow all

23 papers · 2 filters

cs.LG2018★ 115 cited

Co-regularized Alignment for Unsupervised Domain Adaptation

Abhishek Kumar, Prasanna Sattigeri, Kahini Wadhawan +4

Deep neural networks, trained with large amount of labeled data, can fail to generalize well when tested with examples from a \emph{target domain} whose distribution differs from t…

cs.LG2018★ 4 cited

Degree- Chow Parameters Robustly Determine Degree- PTFs (and Algorithmic Applications)

Ilias Diakonikolas, Daniel M. Kane

The degree- Chow parameters of a Boolean function are its degree at most Fourier coefficients. It is well-known that degree- Chow parameter…

cs.LG2018★ 14 cited

LoAdaBoost: loss-based AdaBoost federated machine learning with reduced computational complexity on IID and non-IID intensive care data

Li Huang, Yifeng Yin, Zeng Fu +3

Intensive care data are valuable for improvement of health care, policy making and many other purposes. Vast amount of such data are stored in different locations, on many differen…

cs.LG2018★ 26 cited

Exact Recovery in the Hypergraph Stochastic Block Model: a Spectral Algorithm

Sam Cole, Yizhe Zhu

We consider the exact recovery problem in the hypergraph stochastic block model (HSBM) with blocks of equal size. More precisely, we consider a random -uniform hypergraph $H…

cs.LG2018★ 23 cited

Exploring Connections Between Active Learning and Model Extraction

Varun Chandrasekaran, Kamalika Chaudhuri, Irene Giacomelli +2

Machine learning is being increasingly used by individuals, research institutions, and corporations. This has resulted in the surge of Machine Learning-as-a-Service (MLaaS) - cloud…

cs.LG2018★ 3 cited

Unifying the stochastic and the adversarial Bandits with Knapsack

Anshuka Rangi, Massimo Franceschetti, Long Tran-Thanh

This paper investigates the adversarial Bandits with Knapsack (BwK) online learning problem, where a player repeatedly chooses to perform an action, pays the corresponding cost, an…

cs.LG2018★ 4 cited

The LORACs prior for VAEs: Letting the Trees Speak for the Data

Sharad Vikram, Matthew D. Hoffman, Matthew J. Johnson

In variational autoencoders, the prior on the latent codes is often treated as an afterthought, but the prior shapes the kind of latent representation that the model learns. If…

cs.LG2018★ 3 cited

Towards Fast and Energy-Efficient Binarized Neural Network Inference on FPGA

Cheng Fu, Shilin Zhu, Hao Su +2

Binarized Neural Network (BNN) removes bitwidth redundancy in classical CNN by using a single bit (-1/+1) for network parameters and intermediate representations, which has greatly…

cs.LG2018★ 2 cited

Spectral Embedding Norm: Looking Deep into the Spectrum of the Graph Laplacian

Xiuyuan Cheng, Gal Mishne

The extraction of clusters from a dataset which includes multiple clusters and a significant background component is a non-trivial task of practical importance. In image analysis t…

cs.LG2018★ 5 cited

Online learning with feedback graphs and switching costs

Anshuka Rangi, Massimo Franceschetti

We study online learning when partial feedback information is provided following every action of the learning process, and the learner incurs switching costs for changing his actio…

cs.LG2018★ 12 cited

Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning

Ery Arias-Castro, Adel Javanmard, Bruno Pelletier

One of the common tasks in unsupervised learning is dimensionality reduction, where the goal is to find meaningful low-dimensional structures hidden in high-dimensional data. Somet…

cs.LG2018★ 4 cited

Learning in Non-convex Games with an Optimization Oracle

Naman Agarwal, Alon Gonen, Elad Hazan

We consider online learning in an adversarial, non-convex setting under the assumption that the learner has an access to an offline optimization oracle. In the general setting of p…

cs.LG2018★ 17 cited

Piano Genie

Chris Donahue, Ian Simon, Sander Dieleman

We present Piano Genie, an intelligent controller which allows non-musicians to improvise on the piano. With Piano Genie, a user performs on a simple interface with eight buttons,…

cs.LG2018★ 12 cited

The Inductive Bias of Restricted f-GANs

Shuang Liu, Kamalika Chaudhuri

Generative adversarial networks are a novel method for statistical inference that have achieved much empirical success; however, the factors contributing to this success remain ill…

cs.LG2018★ 6 cited

Adversarial Imitation via Variational Inverse Reinforcement Learning

Ahmed H. Qureshi, Byron Boots, Michael C. Yip

We consider a problem of learning the reward and policy from expert examples under unknown dynamics. Our proposed method builds on the framework of generative adversarial networks…

cs.LG2018★ 52 cited

Data Poisoning Attacks against Online Learning

Yizhen Wang, Kamalika Chaudhuri

We consider data poisoning attacks, a class of adversarial attacks on machine learning where an adversary has the power to alter a small fraction of the training data in order to m…

cs.LG2018★ 43 cited

Generative adversarial interpolative autoencoding: adversarial training on latent space interpolations encourage convex latent distributions

Tim Sainburg, Marvin Thielk, Brad Theilman +2

We present a neural network architecture based upon the Autoencoder (AE) and Generative Adversarial Network (GAN) that promotes a convex latent distribution by training adversarial…

cs.LG2018★ 15 cited

Binary Ensemble Neural Network: More Bits per Network or More Networks per Bit?

Shilin Zhu, Xin Dong, Hao Su

Binary neural networks (BNN) have been studied extensively since they run dramatically faster at lower memory and power consumption than floating-point networks, thanks to the effi…

cs.LG2018★ 2 cited

Supervised Policy Update for Deep Reinforcement Learning

Quan Vuong, Yiming Zhang, Keith W. Ross

We propose a new sample-efficient methodology, called Supervised Policy Update (SPU), for deep reinforcement learning. Starting with data generated by the current policy, SPU formu…

cs.LG2018

Structural query-by-committee

Christopher Tosh, Sanjoy Dasgupta

In this work, we describe a framework that unifies many different interactive learning tasks. We present a generalization of the {\it query-by-committee} active learning algorithm…

cs.LG2018★ 142 cited

Sever: A Robust Meta-Algorithm for Stochastic Optimization

Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane +3

In high dimensions, most machine learning methods are brittle to even a small fraction of structured outliers. To address this, we introduce a new meta-algorithm that can take in a…

cs.LG2018★ 4 cited

Comparison Based Learning from Weak Oracles

Ehsan Kazemi, Lin Chen, Sanjoy Dasgupta +1

There is increasing interest in learning algorithms that involve interaction between human and machine. Comparison-based queries are among the most natural ways to get feedback fro…

cs.LG2018★ 16 cited

Active Learning with Logged Data

Songbai Yan, Kamalika Chaudhuri, Tara Javidi

We consider active learning with logged data, where labeled examples are drawn conditioned on a predetermined logging policy, and the goal is to learn a classifier on the entire po…