Papers
1,876 papers found
Near-optimal sample compression for nearest neighbors
Lee-Ad Gottlieb, Aryeh Kontorovich, Pinhas Nisnevitch
Computing Nash Equilibria in Generalized Interdependent Security Games
Hau Chan, Luis E. Ortiz
General Table Completion using a Bayesian Nonparametric Model
Isabel Valera, Zoubin Ghahramani
Matrix Completion with Noisy Side Information
Kai-Yang Chiang, Cho-Jui Hsieh, Inderjit S Dhillon
Interactive Control of Diverse Complex Characters with Neural Networks
Igor Mordatch, Kendall Lowrey, Galen Andrew et al.
Scalable Adaptation of State Complexity for Nonparametric Hidden Markov Models
Michael C Hughes, William T Stephenson, Erik Sudderth
Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning
Christoph Dann, Emma Brunskill
Convergence rates of sub-sampled Newton methods
Murat A Erdogdu, Andrea Montanari
Communication Complexity of Distributed Convex Learning and Optimization
Yossi Arjevani, Ohad Shamir
Sample Complexity of Learning Mahalanobis Distance Metrics
Nakul Verma, Kristin Branson
Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems
Ruoyu Sun, Mingyi Hong
A Complete Recipe for Stochastic Gradient MCMC
Yi-An Ma, Tianqi Chen, Emily B. Fox
Tractable Learning for Complex Probability Queries
Jessa Bekker, Jesse Davis, Arthur Choi et al.
Robust PCA with compressed data
Wooseok Ha, Rina Foygel Barber
On Elicitation Complexity
Rafael Frongillo, Ian Kash
Matrix Completion Under Monotonic Single Index Models
Ravi Sastry Ganti, Laura Balzano, Rebecca Willett
CMA-ES with Optimal Covariance Update and Storage Complexity
Oswin Krause, Dídac Rodríguez Arbonès, Christian Igel
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems
Yossi Arjevani, Ohad Shamir
Completely random measures for modelling block-structured sparse networks
Tue Herlau, Mikkel N Schmidt, Morten Mørup
Towards Conceptual Compression
Karol Gregor, Frederic Besse, Danilo Jimenez Rezende et al.
Coupled Generative Adversarial Networks
Ming-Yu Liu, Oncel Tuzel
Structured Prediction Theory Based on Factor Graph Complexity
Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri et al.
Tight Complexity Bounds for Optimizing Composite Objectives
Blake E Woodworth, Nati Srebro
Matrix Completion has No Spurious Local Minimum
Rong Ge, Jason Lee, Tengyu Ma
Mixed Linear Regression with Multiple Components
Kai Zhong, Prateek Jain, Inderjit S Dhillon