Nathan Srebro

Orcid: 0000-0002-0763-1740

Affiliations:
  • Toyota Technological Institute at Chicago, USA


According to our database1, Nathan Srebro authored at least 200 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Provable Tempered Overfitting of Minimal Nets and Typical Nets.
CoRR, 2024

Overfitting Behaviour of Gaussian Kernel Ridgeless Regression: Varying Bandwidth or Dimensionality.
CoRR, 2024

On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries.
CoRR, 2024

The Price of Implicit Bias in Adversarially Robust Generalization.
CoRR, 2024

How Uniform Random Weights Induce Non-uniform Bias: Typical Interpolating Neural Networks Generalize with Narrow Teachers.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

An Agnostic View on the Cost of Overfitting in (Kernel) Ridge Regression.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Noisy Interpolation Learning with Shallow Univariate ReLU Networks.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Score Design for Multi-Criteria Incentivization.
Proceedings of the 5th Symposium on Foundations of Responsible Computing, 2024

The Limits and Potentials of Local SGD for Distributed Heterogeneous Learning with Intermittent Communication.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Depth Separation in Norm-Bounded Infinite-Width Neural Networks.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Metalearning with Very Few Samples Per Task.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
Lower bounds for non-convex stochastic optimization.
Math. Program., May, 2023

Applying statistical learning theory to deep learning.
CoRR, 2023

Efficiently Learning Neural Networks: What Assumptions May Suffice?
CoRR, 2023

Interpolation Learning With Minimum Description Length.
CoRR, 2023

Uniform Convergence with Square-Root Lipschitz Loss.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

When is Agnostic Reinforcement Learning Statistically Tractable?
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

The Double-Edged Sword of Implicit Bias: Generalization vs. Robustness in ReLU Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Most Neural Networks Are Almost Learnable.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Federated Online and Bandit Convex Optimization.
Proceedings of the International Conference on Machine Learning, 2023

Continual Learning in Linear Classification on Separable Data.
Proceedings of the International Conference on Machine Learning, 2023

Implicit Bias in Leaky ReLU Networks Trained on High-Dimensional Data.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Shortest Program Interpolation Learning.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Benign Overfitting in Linear Classifiers and Leaky ReLU Networks from KKT Conditions for Margin Maximization.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Pessimism for Offline Linear Contextual Bandits using 𝓁<sub>p</sub> Confidence Sets.
CoRR, 2022

A Non-Asymptotic Moreau Envelope Theory for High-Dimensional Generalized Linear Models.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On Margin Maximization in Linear and ReLU Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

The Sample Complexity of One-Hidden-Layer Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Towards Optimal Communication Complexity in Distributed Non-Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Adversarially Robust Learning: A Generic Minimax Optimal Learner and Characterization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Pessimism for Offline Linear Contextual Bandits using $\ell_p$ Confidence Sets.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Exponential Family Model-Based Reinforcement Learning via Score Matching.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Understanding the Eluder Dimension.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Thinking Outside the Ball: Optimal Learning with Gradient Descent for Generalized Linear Stochastic Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication (Extended Abstract).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Implicit Bias of the Step Size in Linear Diagonal Neural Networks.
Proceedings of the International Conference on Machine Learning, 2022

How catastrophic can catastrophic forgetting be in linear regression?
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Transductive Robust Learning Guarantees.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
An accelerated communication-efficient primal-dual optimization framework for structured machine learning.
Optim. Methods Softw., 2021

Exponential Family Model-Based Reinforcement Learning via Score Matching.
CoRR, 2021

Optimistic Rates: A Unifying Theory for Interpolation Learning and Regularization in Linear Regression.
CoRR, 2021

Eluder Dimension and Generalized Rank.
CoRR, 2021

An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Uniform Convergence of Interpolators: Gaussian Width, Norm Bounds and Benign Overfitting.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Representation Costs of Linear Neural Networks: Analysis and Design.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Stochastic Newton Algorithm for Distributed Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On the Power of Differentiable Learning versus PAC and SQ Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels.
Proceedings of the 38th International Conference on Machine Learning, 2021

Fast margin maximization via dual acceleration.
Proceedings of the 38th International Conference on Machine Learning, 2021

On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descent.
Proceedings of the 38th International Conference on Machine Learning, 2021

Dropout: Explicit Forms and Capacity Control.
Proceedings of the 38th International Conference on Machine Learning, 2021

The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication.
Proceedings of the Conference on Learning Theory, 2021

Adversarially Robust Learning with Unknown Perturbation Sets.
Proceedings of the Conference on Learning Theory, 2021

Does Invariant Risk Minimization Capture Invariance?
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Predictive Value Generalization Bounds.
CoRR, 2020

Mirrorless Mirror Descent: A More Natural Discretization of Riemannian Gradient Flow.
CoRR, 2020

On Uniform Convergence and Low-Norm Interpolation Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Minibatch vs Local SGD for Heterogeneous Distributed Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracy.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Reducing Adversarially Robust Learning to Non-Robust PAC Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Is Local SGD Better than Minibatch SGD?
Proceedings of the 37th International Conference on Machine Learning, 2020

Fair Learning with Private Demographic Data.
Proceedings of the 37th International Conference on Machine Learning, 2020

Efficiently Learning Adversarially Robust Halfspaces with Noise.
Proceedings of the 37th International Conference on Machine Learning, 2020

A Function Space View of Bounded Norm Infinite Width ReLU Nets: The Multivariate Case.
Proceedings of the 8th International Conference on Learning Representations, 2020

Kernel and Rich Regimes in Overparametrized Models.
Proceedings of the Conference on Learning Theory, 2020

Approximate is Good Enough: Probabilistic Variants of Dimensional and Margin Complexity.
Proceedings of the Conference on Learning Theory, 2020

A Tight Convergence Analysis for Stochastic Gradient Descent with Delayed Updates.
Proceedings of the Algorithmic Learning Theory, 2020

Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Stochastic Canonical Correlation Analysis.
J. Mach. Learn. Res., 2019

Simple Surveys: Response Retrieval Inspired by Recommendation Systems.
CoRR, 2019

Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Models.
Proceedings of the 36th International Conference on Machine Learning, 2019

Semi-Cyclic Stochastic Gradient Descent.
Proceedings of the 36th International Conference on Machine Learning, 2019

Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraints.
Proceedings of the 36th International Conference on Machine Learning, 2019

The role of over-parametrization in generalization of neural networks.
Proceedings of the 7th International Conference on Learning Representations, 2019

From Fair Decision Making To Social Equality.
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019

Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory.
Proceedings of the Conference on Learning Theory, 2019

How do infinite width bounded norm networks look in function space?
Proceedings of the Conference on Learning Theory, 2019

VC Classes are Adversarially Robustly Learnable, but Only Improperly.
Proceedings of the Conference on Learning Theory, 2019

The Complexity of Making the Gradient Small in Stochastic Convex Optimization.
Proceedings of the Conference on Learning Theory, 2019

Stochastic Nonconvex Optimization with Large Minibatches.
Proceedings of the Algorithmic Learning Theory, 2019

Stochastic Gradient Descent on Separable Data: Exact Convergence with a Fixed Learning Rate.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Convergence of Gradient Descent on Separable Data.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
The Implicit Bias of Gradient Descent on Separable Data.
J. Mach. Learn. Res., 2018

Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networks.
CoRR, 2018

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization.
CoRR, 2018

Convergence of Gradient Descent on Separable Data.
CoRR, 2018

Distributed Stochastic Multi-Task Learning with Graph Regularization.
CoRR, 2018

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

The Everlasting Database: Statistical Validity at a Fair Price.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Implicit Bias of Gradient Descent on Linear Convolutional Networks.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

On preserving non-discrimination when combining expert advice.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Characterizing Implicit Bias in Terms of Optimization Geometry.
Proceedings of the 35th International Conference on Machine Learning, 2018

The Implicit Bias of Gradient Descent on Separable Data.
Proceedings of the 6th International Conference on Learning Representations, 2018

A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks.
Proceedings of the 6th International Conference on Learning Representations, 2018

Efficient coordinate-wise leading eigenvector computation.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Data-Dependent Convergence for Consensus Stochastic Optimization.
IEEE Trans. Autom. Control., 2017

The Implicit Bias of Gradient Descent on Separable Data.
CoRR, 2017

Geometry of Optimization and Implicit Regularization in Deep Learning.
CoRR, 2017

A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks.
CoRR, 2017

The Marginal Value of Adaptive Gradient Methods in Machine Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Exploring Generalization in Deep Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Implicit Regularization in Matrix Factorization.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Stochastic Approximation for Canonical Correlation Analysis.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Efficient Distributed Learning with Sparsity.
Proceedings of the 34th International Conference on Machine Learning, 2017

Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis.
Proceedings of the 34th International Conference on Machine Learning, 2017

Learning Non-Discriminatory Predictors.
Proceedings of the 30th Conference on Learning Theory, 2017

Memory and Communication Efficient Distributed Stochastic Optimization with Minibatch Prox.
Proceedings of the 30th Conference on Learning Theory, 2017

Sketching Meets Random Projection in the Dual: A Provable Recovery Algorithm for Big and High-dimensional Data.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm.
Math. Program., 2016

Globally Convergent Stochastic Optimization for Canonical Correlation Analysis.
CoRR, 2016

Reducing Runtime by Recycling Samples.
CoRR, 2016

Distributed Multi-Task Learning with Shared Representation.
CoRR, 2016

Data-Dependent Path Normalization in Neural Networks.
Proceedings of the 4th International Conference on Learning Representations, 2016

Tight Complexity Bounds for Optimizing Composite Objectives.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Efficient Globally Convergent Stochastic Optimization for Canonical Correlation Analysis.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Normalized Spectral Map Synchronization.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Path-Normalized Optimization of Recurrent Neural Networks with ReLU Activations.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Equality of Opportunity in Supervised Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Global Optimality of Local Search for Low Rank Matrix Recovery.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Data-dependent bounds on network gradient descent.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

Distributed Multi-Task Learning.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

Fast and Scalable Structural SVM with Slack Rescaling.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Learning sparse low-threshold linear classifiers.
J. Mach. Learn. Res., 2015

Distributed Multitask Learning.
CoRR, 2015

Distributed Mini-Batch SDCA.
CoRR, 2015

In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learning.
Proceedings of the 3rd International Conference on Learning Representations, 2015

Normalized Hierarchical SVM.
CoRR, 2015

Path-SGD: Path-Normalized Optimization in Deep Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

On Symmetric and Asymmetric LSHs for Inner Product Search.
Proceedings of the 32nd International Conference on Machine Learning, 2015

Norm-Based Capacity Control in Neural Networks.
Proceedings of The 28th Conference on Learning Theory, 2015

Stochastic optimization for deep CCA via nonlinear orthogonal iterations.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Efficient Training of Structured SVMs via Soft Constraints.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014
Active collaborative permutation learning.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Communication-Efficient Distributed Optimization using an Approximate Newton-type Method.
Proceedings of the 31th International Conference on Machine Learning, 2014

Clustering, Hamming Embedding, Generalized LSH and the Max Norm.
Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

Distributed stochastic optimization and learning.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Distribution-dependent sample complexity of large margin learning.
J. Mach. Learn. Res., 2013

Stochastic gradient descent and the randomized Kaczmarz algorithm.
CoRR, 2013

Auditing: Active Learning with Outcome-Dependent Query Costs.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

The Power of Asymmetry in Binary Hashing.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Stochastic Optimization of PCA with Capped MSG.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Mini-Batch Primal and Dual Methods for SVMs.
Proceedings of the 30th International Conference on Machine Learning, 2013

Learning Optimally Sparse Support Vector Machines.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Approximate Inference by Intersecting Semidefinite Bound and Local Polytope.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Preface.
Proceedings of the COLT 2012, 2012

PRISMA: PRoximal Iterative SMoothing Algorithm
CoRR, 2012

Sparse Prediction with the k-Overlap Norm
CoRR, 2012

Characterizing the Sample Complexity of Large-Margin Learning With Second-Order Statistics
CoRR, 2012

Matrix reconstruction with the local max norm.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Sparse Prediction with the $k$-Support Norm.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Clustering using Max-norm Constrained Optimization.
Proceedings of the 29th International Conference on Machine Learning, 2012

The Kernelized Stochastic Batch Perceptron.
Proceedings of the 29th International Conference on Machine Learning, 2012

Minimizing The Misclassification Error Rate Using a Surrogate Convex Loss.
Proceedings of the 29th International Conference on Machine Learning, 2012

Stochastic optimization for PCA and PLS.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Pegasos: primal estimated sub-gradient solver for SVM.
Math. Program., 2011

Error Analysis of Laplacian Eigenmaps for Semi-supervised Learning.
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

Concentration-Based Guarantees for Low-Rank Matrix Reconstruction.
Proceedings of the COLT 2011, 2011

Explicit Approximations of the Gaussian Kernel
CoRR, 2011

Semi-supervised Learning with Density Based Distances.
Proceedings of the UAI 2011, 2011

On the Universality of Online Mirror Descent.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Beating SGD: Learning SVMs in Sublinear Time.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Learning with the weighted trace-norm under arbitrary sampling distributions.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Better Mini-Batch Algorithms via Accelerated Gradient Methods.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

An iterated graph laplacian approach for ranking on manifolds.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

A GPU-tailored approach for training kernelized SVMs.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints.
SIAM J. Optim., 2010

Learnability, Stability and Uniform Convergence.
J. Mach. Learn. Res., 2010

Reducing Label Complexity by Learning From Bags.
Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010

Smoothness, Low Noise and Fast Rates.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Tight Sample Complexity of Large-Margin Learning.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Practical Large-Scale Optimization for Max-norm Regularization.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

On the Interaction between Norm and Dimensionality: Multiple Regimes in Learning.
Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

2009
Statistical Analysis of Semi-Supervised Learning: The Limit of Infinite Unlabelled Data.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

Learnability and Stability in the General Learning Setting.
Proceedings of the COLT 2009, 2009

Stochastic Convex Optimization.
Proceedings of the COLT 2009, 2009

2008
A theory of learning with similarity functions.
Mach. Learn., 2008

Complexity of Inference in Graphical Models.
Proceedings of the UAI 2008, 2008

Fast Rates for Regularized Objectives.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

SVM optimization: inverse dependence on training set size.
Proceedings of the Machine Learning, 2008

Improved Guarantees for Learning via Similarity Functions.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM.
Proceedings of the Machine Learning, 2007

Uncovering shared structures in multiclass classification.
Proceedings of the Machine Learning, 2007

Are There Local Maxima in the Infinite-Sample Likelihood of Gaussian Mixture Estimation?
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

How Good Is a Kernel When Used as a Similarity Measure?
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

<i>l</i><sub>1</sub> Regularization in Infinite Dimensional Feature Spaces.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
An investigation of computational and informational limits in Gaussian mixture clustering.
Proceedings of the Machine Learning, 2006

Learning Bounds for Support Vector Machines with Learned Kernels.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005
Fast maximum margin matrix factorization for collaborative prediction.
Proceedings of the Machine Learning, 2005

Rank, Trace-Norm and Max-Norm.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004
Learning with matrix factorizations.
PhD thesis, 2004

Maximum-Margin Matrix Factorization.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

2003
K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data.
Bioinform., 2003

Maximum likelihood bounded tree-width Markov networks.
Artif. Intell., 2003

Linear Dependent Dimensionality Reduction.
Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

Weighted Low-Rank Approximations.
Proceedings of the Machine Learning, 2003

2001
Learning Markov networks: maximum bounded tree-width graphs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001


  Loading...