Get our free extension to see links to code for papers anywhere online!

 Add to Chrome

 Add to Firefox

CatalyzeX Code Finder - Browser extension linking code for ML papers across the web! | Product Hunt Embed
Information Theoretic Sample Complexity Lower Bound for Feed-Forward Fully-Connected Deep Networks

Jul 01, 2020
Xiaochen Yang, Jean Honorio


  Access Paper or Ask Questions

Fundamental Limits of Adversarial Learning

Jul 01, 2020
Kevin Bello, Qiuling Xu, Jean Honorio

* 13 pages 

  Access Paper or Ask Questions

Fairness constraints can help exact inference in structured prediction

Jul 01, 2020
Kevin Bello, Jean Honorio

* 10pages, 3 figures 

  Access Paper or Ask Questions

Support Union Recovery in Meta Learning of Gaussian Graphical Models

Jun 22, 2020
Qian Zhang, Yilin Zheng, Jean Honorio


  Access Paper or Ask Questions

Exact Support Recovery in Federated Regression with One-shot Communication

Jun 22, 2020
Adarsh Barik, Jean Honorio


  Access Paper or Ask Questions

Exact Partitioning of High-order Planted Models with a Tensor Nuclear Norm Constraint

Jun 20, 2020
Chuyang Ke, Jean Honorio


  Access Paper or Ask Questions

Provable Sample Complexity Guarantees for Learning of Continuous-Action Graphical Games with Nonparametric Utilities

Apr 01, 2020
Adarsh Barik, Jean Honorio

* arXiv admin note: text overlap with arXiv:1911.04225 

  Access Paper or Ask Questions

Information-Theoretic Lower Bounds for Zero-Order Stochastic Gradient Estimation

Mar 31, 2020
Abdulrahman Alabdulkareem, Jean Honorio


  Access Paper or Ask Questions

First Order Methods take Exponential Time to Converge to Global Minimizers of Non-Convex Functions

Feb 28, 2020
Krishna Reddy Kesari, Jean Honorio


  Access Paper or Ask Questions

Novel Change of Measure Inequalities and PAC-Bayesian Bounds

Feb 25, 2020
Yuki Ohnishi, Jean Honorio

* 9 pages 

  Access Paper or Ask Questions

The Sample Complexity of Meta Sparse Regression

Feb 22, 2020
Zhanyu Wang, Jean Honorio


  Access Paper or Ask Questions

Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games

Nov 08, 2019
Adarsh Barik, Jean Honorio


  Access Paper or Ask Questions

Exact Partitioning of High-order Models with a Novel Convex Tensor Cone Relaxation

Nov 06, 2019
Chuyang Ke, Jean Honorio


  Access Paper or Ask Questions

Direct Estimation of Difference Between Structural Equation Models in High Dimensions

Jun 28, 2019
Asish Ghoshal, Jean Honorio


  Access Paper or Ask Questions

Exact inference in structured prediction

Jun 02, 2019
Kevin Bello, Jean Honorio


  Access Paper or Ask Questions

Minimax bounds for structured prediction

Jun 02, 2019
Kevin Bello, Asish Ghoshal, Jean Honorio


  Access Paper or Ask Questions

On the Correctness and Sample Complexity of Inverse Reinforcement Learning

Jun 02, 2019
Abi Komanduru, Jean Honorio


  Access Paper or Ask Questions

Learning Bayesian Networks with Low Rank Conditional Probability Tables

May 29, 2019
Adarsh Barik, Jean Honorio


  Access Paper or Ask Questions

Exact Recovery in the Latent Space Model

Jan 28, 2019
Chuyang Ke, Jean Honorio


  Access Paper or Ask Questions

On the Statistical Efficiency of Optimal Kernel Sum Classifiers

Jan 25, 2019
Raphael Arkady Meyer, Jean Honorio


  Access Paper or Ask Questions

Regularized Loss Minimizers with Local Data Perturbation: Consistency and Data Irrecoverability

Oct 20, 2018
Zitao Li, Jean Honorio


  Access Paper or Ask Questions

Cost-Aware Rademacher Complexity of Multiple Experiments

Oct 05, 2018
Longyun Guo, Jean Honorio, John Morgan

* 15 pages, 2 figures 

  Access Paper or Ask Questions

Learning discrete Bayesian networks in polynomial time and sample complexity

Oct 05, 2018
Adarsh Barik, Jean Honorio


  Access Paper or Ask Questions

Statistically and Computationally Efficient Variance Estimator for Kernel Ridge Regression

Sep 17, 2018
Meimei Liu, Jean Honorio, Guang Cheng

* To Appear in 2018 Allerton 

  Access Paper or Ask Questions

Learning latent variable structured prediction models with Gaussian perturbations

May 23, 2018
Kevin Bello, Jean Honorio


  Access Paper or Ask Questions

Information-theoretic Limits for Community Detection in Network Models

May 22, 2018
Chuyang Ke, Jean Honorio


  Access Paper or Ask Questions

Learning Maximum-A-Posteriori Perturbation Models for Structured Prediction in Polynomial Time

May 21, 2018
Asish Ghoshal, Jean Honorio

* Accepted to ICML 2018 

  Access Paper or Ask Questions

The Error Probability of Random Fourier Features is Dimensionality Independent

May 18, 2018
Jean Honorio, Yu-Jun Li


  Access Paper or Ask Questions

Learning causal Bayes networks using interventional path queries in polynomial time and sample complexity

Feb 22, 2018
Kevin Bello, Jean Honorio


  Access Paper or Ask Questions

Learning Sparse Polymatrix Games in Polynomial Time and Sample Complexity

Nov 20, 2017
Asish Ghoshal, Jean Honorio


  Access Paper or Ask Questions