Jiantao Jiao

Kannan Ramchandran

CoRR, 2024

Generative AI Security: Challenges and Countermeasures.

[BibT_eX]

[DOI]

CoRR, 2024

Efficient Prompt Caching via Embedding Similarity.

[BibT_eX]

[DOI]

Hanlin Zhu

CoRR, 2024

Iterative Data Smoothing: Mitigating Reward Overfitting and Overoptimization in RLHF.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Towards Optimal Statistical Watermarking.

[BibT_eX]

[DOI]

CoRR, 2023

End-to-end Story Plot Generator.

[BibT_eX]

[DOI]

CoRR, 2023

Pairwise Proximal Policy Optimization: Harnessing Relative Feedback for LLM Alignment.

[BibT_eX]

[DOI]

CoRR, 2023

Guided Online Distillation: Promoting Safe Reinforcement Learning by Offline Demonstration.

[BibT_eX]

[DOI]

CoRR, 2023

Fine-Tuning Language Models with Advantage-Induced Policy Alignment.

[BibT_eX]

[DOI]

Hiteshi Sharma

Felipe Vieira Frujeri

CoRR, 2023

On Optimal Caching and Model Multiplexing for Large Model Inference.

[BibT_eX]

[DOI]

CoRR, 2023

Online Learning in a Creator Economy.

[BibT_eX]

[DOI]

Sai Praneeth Karimireddy

CoRR, 2023

Beyond UCB: Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits.

[BibT_eX]

[DOI]

CoRR, 2023

The Sample Complexity of Online Contract Design.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Importance Weighted Actor-Critic for Optimal Conservative Offline Reinforcement Learning.

[BibT_eX]

[DOI]

Hanlin Zhu

Paria Rashidinejad

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Doubly-Robust Self-Training.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Towards Optimal Caching and Model Selection for Large Model Inference.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Optimal Bounds for Noisy Computing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Principled Reinforcement Learning with Human Feedback from Pairwise or K-wise Comparisons.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Online Learning in Stackelberg Games with an Omniscient Follower.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Jump-Start Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Byzantine-Robust Federated Learning with Optimal Statistical Rates.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Minimax Off-Policy Evaluation for Multi-Armed Bandits.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Computational Benefits of Intermediate Rewards for Goal-Reaching Policy Learning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Beyond the Best: Estimating Distribution Functionals in Infinite-Armed Bandits.

[BibT_eX]

[DOI]

CoRR, 2022

Byzantine-Robust Federated Learning with Optimal Statistical Rates and Privacy Guarantees.

[BibT_eX]

[DOI]

CoRR, 2022

Robust Estimation for Nonparametric Families via Generative Adversarial Networks.

[BibT_eX]

[DOI]

CoRR, 2022

Beyond the Best: Distribution Functional Estimation in Infinite-Armed Bandits.

[BibT_eX]

[DOI]

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

Minimax Optimal Online Imitation Learning via Replay Estimation.

[BibT_eX]

[DOI]

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

Robust Estimation for Non-parametric Families via Generative Adversarial Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Nearly Optimal Policy Optimization with Stable at Any Time Guarantee.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

Securing Secure Aggregation: Mitigating Multi-Round Privacy Leakage in Federated Learning.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Computational Benefits of Intermediate Rewards for Hierarchical Planning.

[BibT_eX]

[DOI]

CoRR, 2021

Provably Breaking the Quadratic Error Compounding Barrier in Imitation Learning, Optimally.

[BibT_eX]

[DOI]

CoRR, 2021

Linear Representation Meta-Reinforcement Learning for Instant Adaptation.

[BibT_eX]

[DOI]

Matt Peng

CoRR, 2021

MADE: Exploration via Maximizing Deviation from Explored Regions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On the Value of Interaction and Function Approximation in Imitation Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Deconstructing Generative Adversarial Networks.

[BibT_eX]

[DOI]

David Tse

IEEE Trans. Inf. Theory, 2020

Bias Correction With Jackknife, Bootstrap, and Taylor Series.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Minimax Estimation of Divergences Between Discrete Distributions.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2020

Robust estimation via generalized quasi-gradients.

[BibT_eX]

[DOI]

Jacob Steinhardt

CoRR, 2020

SLIP: Learning to predict in unknown dynamical systems with long-term memory.

[BibT_eX]

[DOI]

Paria Rashidinejad

Stuart Russell

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Toward the Fundamental Limits of Imitation Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

When does the Tukey Median work?

[BibT_eX]

[DOI]

Jacob Steinhardt

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Estimating the Fundamental Limits is Easier Than Achieving the Fundamental Limits.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Approximate Profile Maximum Likelihood.

[BibT_eX]

[DOI]

Dmitri S. Pavlichin

J. Mach. Learn. Res., 2019

Generalized Resilience and Robust Statistics.

[BibT_eX]

[DOI]

Jacob Steinhardt

CoRR, 2019

Barracuda: The Power of ℓ-polling in Proof-of-Stake Blockchains.

[BibT_eX]

[DOI]

Giulia Fanti

Ashok Vardhan Makkuva

Sewoong Oh

Ranvir Rana

Pramod Viswanath

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2019

Theoretically Principled Trade-off between Robustness and Accuracy.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Mutual Information, Relative Entropy and Estimation Error in Semi-Martingale Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Minimax Estimation of the L1 Distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Stackelberg GAN: Towards Provable Minimax Equilibrium via Multi-Generator Architectures.

[BibT_eX]

[DOI]

CoRR, 2018

Concentration Inequalities for the Empirical Distribution.

[BibT_eX]

[DOI]

CoRR, 2018

The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal.

[BibT_eX]

[DOI]

Weihao Gao

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Entropy Rate Estimation for Markov Chains with Large State Space.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Minimax Redundancy for Markov Chains with Large State Space.

[BibT_eX]

[DOI]

Kedar Tatwawadi

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance.

[BibT_eX]

[DOI]

Proceedings of the Conference On Learning Theory, 2018

2017

Relations Between Information and Estimation in Discrete-Time Lévy Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Maximum Likelihood Estimation of Functionals of Discrete Distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Optimal rates of entropy estimation over Lipschitz balls.

[BibT_eX]

[DOI]

CoRR, 2017

On Estimation of L{r}-Norms in Gaussian White Noise Models.

[BibT_eX]

[DOI]

CoRR, 2017

Bias Correction with Jackknife, Bootstrap, and Taylor Series.

[BibT_eX]

[DOI]

CoRR, 2017

Minimax Estimation of the $L_1$ Distance.

[BibT_eX]

[DOI]

CoRR, 2017

Dependence measures bounding the exploration bias for general measurements.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Demystifying ResNet.

[BibT_eX]

[DOI]

CoRR, 2016

Minimax Estimation of KL Divergence between Discrete Distributions.

[BibT_eX]

[DOI]

CoRR, 2016

Minimax rate-optimal estimation of KL divergence between discrete distributions.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Minimax estimation of the L1 distance.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Beyond maximum likelihood: Boosting the Chow-Liu algorithm for large alphabets.

[BibT_eX]

[DOI]

Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016

2015

Minimax Estimation of Functionals of Discrete Distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Justification of Logarithmic Loss via the Benefit of Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Minimax Estimation of Discrete Distributions Under ℓ1 Loss.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Minimax estimation of information measures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Maximum Likelihood Estimation of information measures.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Minimax estimation of discrete distributions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Adaptive estimation of Shannon entropy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Does dirichlet prior smoothing solve the Shannon entropy estimation problem?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Information Measures: The Curious Case of the Binary Alphabet.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Maximum Likelihood Estimation of Functionals of Discrete Distributions.

[BibT_eX]

[DOI]

CoRR, 2014

Order-Optimal Estimation of Functionals of Discrete Distributions.

[BibT_eX]

[DOI]

CoRR, 2014

Beyond Maximum Likelihood: from Theory to Practice.

[BibT_eX]

[DOI]

CoRR, 2014

Relations between information and estimation in scalar Lévy channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Information divergences and the curious case of the binary alphabet.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

An extremal inequality for long Markov chains.

[BibT_eX]

[DOI]

Thomas A. Courtade

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Universal Estimation of Directed Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Pointwise relations between information and estimation in the Poisson channel.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Minimax-Optimal Bounds for Detectors Based on Estimated Prior Probabilities.

[BibT_eX]

[DOI]