Jean Honorio

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 126

Top Venues

Publications

Wenjie Li, Qifan Song, Jean Honorio, Guang Lin
Federated X-armed Bandit. AAAI (2024)
Chuyang Ke, Jean Honorio
Provable Guarantees for Sparsity Recovery with Deterministic Missing Data Patterns. Trans. Mach. Learn. Res. 2024 (2024)
Site Bai, Chuyang Ke, Jean Honorio
On the Dual Problem of Convexified Convolutional Neural Networks. Trans. Mach. Learn. Res. 2024 (2024)
Adarsh Barik, Jean Honorio
Recovering Exact Support in Federated lasso without Optimization. Trans. Mach. Learn. Res. 2024 (2024)
Wenjie Li, Qifan Song, Jean Honorio
Personalized Federated X-armed Bandit. AISTATS (2024)
Chuyang Ke, Jean Honorio
Exact Inference in High-order Structured Prediction. CoRR (2023)
Adarsh Barik, Jean Honorio
Outlier-robust Estimation of a Sparse Linear Model Using Invexity. CoRR (2023)
Shixiong Wang, Haowei Wang, Jean Honorio
Learning Against Distributional Uncertainty: On the Trade-off Between Robustness and Specificity. CoRR (2023)
Wenjie Li, Haoze Li, Jean Honorio, Qifan Song
PyXAB - A Python Library for X-Armed Bandit and Online Blackbox Optimization Algorithms. CoRR (2023)
Hanbyul Lee, Qifan Song, Jean Honorio
Support Recovery in Sparse PCA with Non-Random Missing Data. CoRR (2023)
Wenjie Li, Qifan Song, Jean Honorio
Personalized Federated X -armed Bandit. CoRR (2023)
Chuyang Ke, Jean Honorio
Partial Inference in Structured Prediction. CoRR (2023)
Hanbyul Lee, Rahul Mazumder, Qifan Song, Jean Honorio
Matrix Completion from General Deterministic Sampling Patterns. CoRR (2023)
Adarsh Barik, Jean Honorio
Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. ICASSP (2023)
Chuyang Ke, Jean Honorio
Exact Inference in High-order Structured Prediction. ICML (2023)
Qiuling Xu, Guanhong Tao, Jean Honorio, Yingqi Liu, Shengwei An, Guangyu Shen, Siyuan Cheng, Xiangyu Zhang
MEDIC: Remove Model Backdoors via Importance Driven Cloning. CVPR (2023)
Adarsh Barik, Suvrit Sra, Jean Honorio
Invex Programs: First Order Algorithms and Their Convergence. CoRR (2023)
Adarsh Barik, Jean Honorio
Provable Sample Complexity Guarantees For Learning Of Continuous-Action Graphical Games With Nonparametric Utilities. ICASSP (2022)
Shixiong Wang, Haowei Wang, Jean Honorio
Distributional Robustness Bounds Generalization Errors. CoRR (2022)
Site Bai, Chuyang Ke, Jean Honorio
Dual Convexified Convolutional Neural Networks. CoRR (2022)
Chuyang Ke, Jean Honorio
Provable Guarantees for Sparsity Recovery with Deterministic Missing Data Patterns. CoRR (2022)
Deepak Maurya, Jean Honorio
A Theoretical Study of The Effects of Adversarial Attacks on Sparse Regression. CoRR (2022)
Hanbyul Lee, Qifan Song, Jean Honorio
Support Recovery in Sparse PCA with Incomplete Data. CoRR (2022)
Kevin Bello, Chuyang Ke, Jean Honorio
A View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy. AISTATS (2022)
Hanbyul Lee, Qifan Song, Jean Honorio
Support Recovery in Sparse PCA with Incomplete Data. NeurIPS (2022)
Wenjie Li, Adarsh Barik, Jean Honorio
A Simple Unified Framework for High Dimensional Bandit Problems. ICML (2022)
Wenjie Li, Qifan Song, Jean Honorio, Guang Lin
Federated X-Armed Bandit. CoRR (2022)
Imon Banerjee, Jean Honorio
Meta Sparse Principal Component Analysis. CoRR (2022)
Adarsh Barik, Jean Honorio
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. CoRR (2022)
Chuyang Ke, Jean Honorio
Exact Partitioning of High-order Models with a Novel Convex Tensor Cone Relaxation. J. Mach. Learn. Res. 23 (2022)
Hanbyul Lee, Kevin Bello, Jean Honorio
On the Fundamental Limits of Exact Inference in Structured Prediction. ISIT (2022)
Deepak Maurya, Adarsh Barik, Jean Honorio
A Novel Plug-and-Play Approach for Adversarially Robust Generalization. CoRR (2022)
Chuyang Ke, Jean Honorio
Exact Partitioning of High-Order Planted Models with A Tensor Nuclear Norm Constraint. ICASSP (2022)
Adarsh Barik, Jean Honorio
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation. ICML (2022)
Chuyang Ke, Jean Honorio
Federated Myopic Community Detection with One-shot Communication. AISTATS (2022)
Adarsh Barik, Jean Honorio
Information Theoretic Limits For Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. ICASSP (2022)
Huiming Xie, Jean Honorio
Meta Learning for High-dimensional Ising Model Selection Using $\ell_1$-regularized Logistic Regression. CoRR (2022)
Jiajun Liang, Chuyang Ke, Jean Honorio
Information Theoretic Limits of Exact Recovery in Sub-hypergraph Models for Community Detection. ISIT (2021)
Qiuling Xu, Kevin Bello, Jean Honorio
A Le Cam Type Bound for Adversarial Learning and Applications. ISIT (2021)
Hanbyul Lee, Kevin Bello, Jean Honorio
On the Fundamental Limits of Exact Inference in Structured Prediction. CoRR (2021)
Abi Komanduru, Jean Honorio
A Lower Bound for the Sample Complexity of Inverse Reinforcement Learning. CoRR (2021)
Zhanyu Wang, Jean Honorio
The Sample Complexity of Meta Sparse Regression. AISTATS (2021)
Manuel Widmoser, Maria Leonor Pacheco, Jean Honorio, Dan Goldwasser
Randomized Deep Structured Prediction for Discourse-Level Processing. CoRR (2021)
Donald Q. Adams, Adarsh Barik, Jean Honorio
Information-Theoretic Bounds for Integral Estimation. ISIT (2021)
Manuel Widmoser, Maria Leonor Pacheco, Jean Honorio, Dan Goldwasser
Randomized Deep Structured Prediction for Discourse-Level Processing. EACL (2021)
Zhikun Zhang, Tianhao Wang, Ninghui Li, Jean Honorio, Michael Backes, Shibo He, Jiming Chen, Yang Zhang
PrivSyn: Differentially Private Data Synthesis. USENIX Security Symposium (2021)
Zitao Li, Jean Honorio
Regularized Loss Minimizers with Local Data Perturbation: Consistency and Data Irrecoverability. ISIT (2021)
Abdulrahman Alabdulkareem, Jean Honorio
Information-theoretic lower bounds for zero-order stochastic gradient estimation. ISIT (2021)
Wenjie Li, Adarsh Barik, Jean Honorio
A Simple Unified Framework for High Dimensional Bandit Problems. CoRR (2021)
Yuki Ohnishi, Jean Honorio
Novel Change of Measure Inequalities with Applications to PAC-Bayesian Bounds and Monte Carlo Estimation. AISTATS (2021)
Donald Q. Adams, Adarsh Barik, Jean Honorio
Information-Theoretic Bounds for Integral Estimation. CoRR (2021)
Chuyang Ke, Jean Honorio
Federated Myopic Community Detection with One-shot Communication. CoRR (2021)
Adarsh Barik, Jean Honorio
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. NeurIPS (2021)
Adarsh Barik, Jean Honorio
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem. CoRR (2021)
Krishna Reddy Kesari, Jean Honorio
First Order Methods take Exponential Time to Converge to Global Minimizers of Non-Convex Functions. ISIT (2021)
Jiajun Liang, Chuyang Ke, Jean Honorio
Information Theoretic Limits of Exact Recovery in Sub-hypergraph Models for Community Detection. CoRR (2021)
Gregory Dexter, Kevin Bello, Jean Honorio
Inverse Reinforcement Learning in the Continuous Setting with Formal Guarantees. CoRR (2021)
Abi Komanduru, Jean Honorio
A Lower Bound for the Sample Complexity of Inverse Reinforcement Learning. ICML (2021)
Qian Zhang, Yilin Zheng, Jean Honorio
Meta Learning for Support Recovery in High-dimensional Precision Matrix Estimation. ICML (2021)
Kevin Bello, Chuyang Ke, Jean Honorio
A Thorough View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy. CoRR (2021)
Gregory Dexter, Kevin Bello, Jean Honorio
Inverse Reinforcement Learning in a Continuous State Space with Formal Guarantees. NeurIPS (2021)
Kevin Bello, Qiuling Xu, Jean Honorio
Fundamental Limits of Adversarial Learning. CoRR (2020)
Kevin Bello, Jean Honorio
Fairness constraints can help exact inference in structured prediction. NeurIPS (2020)
Kevin Bello, Asish Ghoshal, Jean Honorio
Minimax Bounds for Structured Prediction Based on Factor Graphs. AISTATS (2020)
Kevin Bello, Jean Honorio
Fairness constraints can help exact inference in structured prediction. CoRR (2020)
Qian Zhang, Yilin Zheng, Jean Honorio
Support Union Recovery in Meta Learning of Gaussian Graphical Models. CoRR (2020)
Zhikun Zhang, Tianhao Wang, Ninghui Li, Jean Honorio, Michael Backes, Shibo He, Jiming Chen, Yang Zhang
PrivSyn: Differentially Private Data Synthesis. CoRR (2020)
Chuyang Ke, Jean Honorio
Exact Partitioning of High-order Planted Models with a Tensor Nuclear Norm Constraint. CoRR (2020)
Yuki Ohnishi, Jean Honorio
Novel Change of Measure Inequalities and PAC-Bayesian Bounds. CoRR (2020)
Adarsh Bank, Jean Honorio
Provable Efficient Skeleton Learning of Encodable Discrete Bayes Nets in Poly-Time and Sample Complexity. ISIT (2020)
Krishna Reddy Kesari, Jean Honorio
First Order Methods take Exponential Time to Converge to Global Minimizers of Non-Convex Functions. CoRR (2020)
Xiaochen Yang, Jean Honorio
Information Theoretic Sample Complexity Lower Bound for Feed-Forward Fully-Connected Deep Networks. CoRR (2020)
Zhanyu Wang, Jean Honorio
The Sample Complexity of Meta Sparse Regression. CoRR (2020)
Abdulrahman Alabdulkareem, Jean Honorio
Information-Theoretic Lower Bounds for Zero-Order Stochastic Gradient Estimation. CoRR (2020)
Adarsh Barik, Jean Honorio
Exact Support Recovery in Federated Regression with One-shot Communication. CoRR (2020)
Adarsh Barik, Jean Honorio
Provable Sample Complexity Guarantees for Learning of Continuous-Action Graphical Games with Nonparametric Utilities. CoRR (2020)
Raphael Arkady Meyer, Jean Honorio
On the Statistical Efficiency of Optimal Kernel Sum Classifiers. CoRR (2019)
Abi Komanduru, Jean Honorio
On the Correctness and Sample Complexity of Inverse Reinforcement Learning. NeurIPS (2019)
Kevin Bello, Jean Honorio
Exact inference in structured prediction. NeurIPS (2019)
Zhaosen Wang, Jean Honorio
Reconstructing a Bounded-Degree Directed Tree Using Path Queries. Allerton (2019)
Adarsh Barik, Jean Honorio
Learning Bayesian Networks with Low Rank Conditional Probability Tables. NeurIPS (2019)
Chuyang Ke, Jean Honorio
Exact Partitioning of High-order Models with a Novel Convex Tensor Cone Relaxation. CoRR (2019)
Kevin Bello, Jean Honorio
Exact inference in structured prediction. CoRR (2019)
Kevin Bello, Asish Ghoshal, Jean Honorio
Minimax bounds for structured prediction. CoRR (2019)
Chuyang Ke, Jean Honorio
Exact Recovery in the Latent Space Model. CoRR (2019)
Longyun Guo, Jean Honorio, John Morgan
Cost-Aware Learning for Improved Identifiability with Multiple Experiments. ISIT (2019)
Adarsh Barik, Jean Honorio
Learning Bayesian Networks with Low Rank Conditional Probability Tables. CoRR (2019)
Adarsh Barik, Jean Honorio
Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games. CoRR (2019)
Abi Komanduru, Jean Honorio
On the Correctness and Sample Complexity of Inverse Reinforcement Learning. CoRR (2019)
Raphael A. Meyer, Jean Honorio
Optimality Implies Kernel Sum Classifiers are Statistically Efficient. ICML (2019)
Kevin Bello, Jean Honorio
Computationally and statistically efficient learning of causal Bayes nets using path queries. NeurIPS (2018)
Kevin Bello, Jean Honorio
Learning latent variable structured prediction models with Gaussian perturbations. NeurIPS (2018)
Adarsh Barik, Jean Honorio
Information Theoretic Limits for Standard and One-Bit Compressed Sensing with Graph-Structured Sparsity. CoRR (2018)
Meimei Liu, Jean Honorio, Guang Cheng
Statistically and Computationally Efficient Variance Estimator for Kernel Ridge Regression. Allerton (2018)
Zitao Li, Jean Honorio
Regularized Loss Minimizers with Local Data Obfuscation. CoRR (2018)
Yixi Xu, Jean Honorio, Xiao Wang
On the Statistical Efficiency of Compositional Nonparametric Prediction. AISTATS (2018)
Asish Ghoshal, Jean Honorio
Learning Maximum-A-Posteriori Perturbation Models for Structured Prediction in Polynomial Time. CoRR (2018)
Chuyang Ke, Jean Honorio
Information-theoretic Limits for Community Detection in Network Models. NeurIPS (2018)
Chuyang Ke, Jean Honorio
Information-theoretic Limits for Community Detection in Network Models. CoRR (2018)
Asish Ghoshal, Jean Honorio
Learning linear structural equation models in polynomial time and sample complexity. AISTATS (2018)

Jean Honorio.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean Honorio