Copertina

Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Fan, Rakhlin, Alexander
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Artificial Intelligence Information Theory Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits
di: Chen, Fan, et al.
Pubblicazione: (2025)

Near-Optimal Learning and Planning in Separated Latent MDPs
di: Chen, Fan, et al.
Pubblicazione: (2024)

Fixed-Budget Differentially Private Best Arm Identification
di: Chen, Zhirui, et al.
Pubblicazione: (2024)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
di: Chen, Fan, et al.
Pubblicazione: (2024)

Beyond Covariance Matrix: The Statistical Complexity of Private Linear Regression
di: Chen, Fan, et al.
Pubblicazione: (2025)

Unified Algorithms for RL with Decision-Estimation Coefficients: PAC, Reward-Free, Preference-Based Learning, and Beyond
di: Chen, Fan, et al.
Pubblicazione: (2022)

Conformal Prediction for Privacy-Preserving Machine Learning
di: Balinsky, Alexander David, et al.
Pubblicazione: (2025)

Neural Networks Learn Generic Multi-Index Models Near Information-Theoretic Limit
di: Zhang, Bohan, et al.
Pubblicazione: (2025)

On the Exponential Convergence for Offline RLHF with Pairwise Comparisons
di: Chen, Zhirui, et al.
Pubblicazione: (2024)

Universal time-series forecasting with mixture predictors
di: Ryabko, Daniil
Pubblicazione: (2020)

Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
di: Zhao, Qingyue, et al.
Pubblicazione: (2026)

MESSY Estimation: Maximum-Entropy based Stochastic and Symbolic densitY Estimation
di: Tohme, Tony, et al.
Pubblicazione: (2023)

Generalization Bounds: Perspectives from Information Theory and PAC-Bayes
di: Hellström, Fredrik, et al.
Pubblicazione: (2023)

Prior-dependent analysis of posterior sampling reinforcement learning with function approximation
di: Li, Yingru, et al.
Pubblicazione: (2024)

Optimality of Staircase Mechanisms for Vector Queries under Differential Privacy
di: Melbourne, James, et al.
Pubblicazione: (2026)

Concentrated Differential Privacy for Bandits
di: Azize, Achraf, et al.
Pubblicazione: (2023)

Le Cam Distortion: A Decision-Theoretic Framework for Robust Transfer Learning
di: Akdemir, Deniz
Pubblicazione: (2025)

Learning with Differentially Private (Sliced) Wasserstein Gradients
di: Rodríguez-Vítores, David, et al.
Pubblicazione: (2025)

Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression
di: Chen, Fan, et al.
Pubblicazione: (2026)

High-accuracy sampling for diffusion models and log-concave distributions
di: Chen, Fan, et al.
Pubblicazione: (2026)

Attack-Aware Noise Calibration for Differential Privacy
di: Kulynych, Bogdan, et al.
Pubblicazione: (2024)

Beyond the Calibration Point: Mechanism Comparison in Differential Privacy
di: Kaissis, Georgios, et al.
Pubblicazione: (2024)

Random Multiplexing
di: Liu, Lei, et al.
Pubblicazione: (2025)

Optimal Regret of Bernoulli Bandits under Global Differential Privacy
di: Azize, Achraf, et al.
Pubblicazione: (2025)

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
di: Shi, Laixi, et al.
Pubblicazione: (2023)

On the Separability of Information in Diffusion Models
di: Premkumar, Akhil
Pubblicazione: (2025)

Analyzing Shapley Additive Explanations to Understand Anomaly Detection Algorithm Behaviors and Their Complementarity
di: Levy, Jordan, et al.
Pubblicazione: (2026)

Entropy, concentration, and learning: a statistical mechanics primer
di: Balsubramani, Akshay
Pubblicazione: (2024)

Provable Robust Overfitting Mitigation in Wasserstein Distributionally Robust Optimization
di: Liu, Shuang, et al.
Pubblicazione: (2025)

A Gapped Scale-Sensitive Dimension and Lower Bounds for Offset Rademacher Complexity
di: Jia, Zeyu, et al.
Pubblicazione: (2025)

On the Variance, Admissibility, and Stability of Empirical Risk Minimization
di: Kur, Gil, et al.
Pubblicazione: (2023)

Refined Risk Bounds for Unbounded Losses via Transductive Priors
di: Qian, Jian, et al.
Pubblicazione: (2024)

Guaranteed Recovery of Unambiguous Clusters
di: Mazooji, Kayvon, et al.
Pubblicazione: (2025)

Provable Reward-Agnostic Preference-Based Reinforcement Learning
di: Zhan, Wenhao, et al.
Pubblicazione: (2023)

Understanding In-Context Learning on Structured Manifolds: Bridging Attention to Kernel Methods
di: Shen, Zhaiming, et al.
Pubblicazione: (2025)

Pessimism in the Face of Confounders: Provably Efficient Offline Reinforcement Learning in Partially Observable Markov Decision Processes
di: Lu, Miao, et al.
Pubblicazione: (2022)

Retrieval-Augmented Generation as Noisy In-Context Learning: A Unified Theory and Risk Bounds
di: Guo, Yang, et al.
Pubblicazione: (2025)

Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games
di: Yan, Yuling, et al.
Pubblicazione: (2022)

Provable Privacy Advantages of Decentralized Federated Learning via Distributed Optimization
di: Yu, Wenrui, et al.
Pubblicazione: (2024)

Asymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
di: Fan, Jianqing, et al.
Pubblicazione: (2025)