Saved in:
| Main Authors: | Shukla, Apurv, Basu, Debabrota |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.02988 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
FraPPE: Fast and Efficient Preference-based Pure Exploration
by: Das, Udvas, et al.
Published: (2025)
by: Das, Udvas, et al.
Published: (2025)
Pure Exploration in Bandits with Linear Constraints
by: Carlsson, Emil, et al.
Published: (2023)
by: Carlsson, Emil, et al.
Published: (2023)
Differentially Private High Dimensional Bandits
by: Shukla, Apurv
Published: (2024)
by: Shukla, Apurv
Published: (2024)
Vector preference-based contextual bandits under distributional shifts
by: Shukla, Apurv, et al.
Published: (2025)
by: Shukla, Apurv, et al.
Published: (2025)
Learning to Explore with Lagrangians for Bandits under Unknown Linear Constraints
by: Das, Udvas, et al.
Published: (2024)
by: Das, Udvas, et al.
Published: (2024)
Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback
by: Della Vecchia, Riccardo, et al.
Published: (2023)
by: Della Vecchia, Riccardo, et al.
Published: (2023)
Some Targets Are Harder to Identify than Others: Quantifying the Target-dependent Membership Leakage
by: Azize, Achraf, et al.
Published: (2024)
by: Azize, Achraf, et al.
Published: (2024)
Auditing Fairness under Model Updates: Fundamental Complexity and Property-Preserving Updates
by: Ajarra, Ayoub, et al.
Published: (2026)
by: Ajarra, Ayoub, et al.
Published: (2026)
Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing
by: Basu, Debabrota, et al.
Published: (2025)
by: Basu, Debabrota, et al.
Published: (2025)
Concentrated Differential Privacy for Bandits
by: Azize, Achraf, et al.
Published: (2023)
by: Azize, Achraf, et al.
Published: (2023)
Isoperimetry is All We Need: Langevin Posterior Sampling for RL with Sublinear Regret
by: Jorge, Emilio, et al.
Published: (2024)
by: Jorge, Emilio, et al.
Published: (2024)
Lagrangian-based Equilibrium Propagation: generalisation to arbitrary boundary conditions & equivalence with Hamiltonian Echo Learning
by: Pourcel, Guillaume, et al.
Published: (2025)
by: Pourcel, Guillaume, et al.
Published: (2025)
FLIPHAT: Joint Differential Privacy for High Dimensional Sparse Linear Bandits
by: Chakraborty, Sunrit, et al.
Published: (2024)
by: Chakraborty, Sunrit, et al.
Published: (2024)
Active Fourier Auditor for Estimating Distributional Properties of ML Models
by: Ajarra, Ayoub, et al.
Published: (2024)
by: Ajarra, Ayoub, et al.
Published: (2024)
Sequential Membership Inference Attacks
by: Michel, Thomas, et al.
Published: (2026)
by: Michel, Thomas, et al.
Published: (2026)
DP-SPRT: Differentially Private Sequential Probability Ratio Tests
by: Michel, Thomas, et al.
Published: (2025)
by: Michel, Thomas, et al.
Published: (2025)
Dynamical-VAE-based Hindsight to Learn the Causal Dynamics of Factored-POMDPs
by: Han, Chao, et al.
Published: (2024)
by: Han, Chao, et al.
Published: (2024)
When Witnesses Defend: A Witness Graph Topological Layer for Adversarial Graph Learning
by: Arafat, Naheed Anjum, et al.
Published: (2024)
by: Arafat, Naheed Anjum, et al.
Published: (2024)
Augmented Bayesian Policy Search
by: Kallel, Mahdi, et al.
Published: (2024)
by: Kallel, Mahdi, et al.
Published: (2024)
Performative Policy Gradient: Optimality in Performative Reinforcement Learning
by: Basu, Debabrota, et al.
Published: (2025)
by: Basu, Debabrota, et al.
Published: (2025)
How does Your RL Agent Explore? An Optimal Transport Analysis of Occupancy Measure Trajectories
by: Nkhumise, Reabetswe M., et al.
Published: (2024)
by: Nkhumise, Reabetswe M., et al.
Published: (2024)
Differentially Private Best-Arm Identification
by: Azize, Achraf, et al.
Published: (2024)
by: Azize, Achraf, et al.
Published: (2024)
DOT: Dynamic Knob Selection and Online Sampling for Automated Database Tuning
by: Wang, Yifan, et al.
Published: (2026)
by: Wang, Yifan, et al.
Published: (2026)
Dimension Agnostic Testing of Survey Data Credibility through the Lens of Regression
by: Basu, Debabrota, et al.
Published: (2025)
by: Basu, Debabrota, et al.
Published: (2025)
Pure Exploration with Feedback Graphs
by: Russo, Alessio, et al.
Published: (2025)
by: Russo, Alessio, et al.
Published: (2025)
Pure Exploration with Infinite Answers
by: Poiani, Riccardo, et al.
Published: (2025)
by: Poiani, Riccardo, et al.
Published: (2025)
Asymptotically Optimal Sequential Testing with Markovian Data
by: Sethi, Alhad, et al.
Published: (2026)
by: Sethi, Alhad, et al.
Published: (2026)
Pure Exploration under Mediators' Feedback
by: Poiani, Riccardo, et al.
Published: (2023)
by: Poiani, Riccardo, et al.
Published: (2023)
Pure Exploration in Asynchronous Federated Bandits
by: Wang, Zichen, et al.
Published: (2023)
by: Wang, Zichen, et al.
Published: (2023)
The Batch Complexity of Bandit Pure Exploration
by: Tuynman, Adrienne, et al.
Published: (2025)
by: Tuynman, Adrienne, et al.
Published: (2025)
In-Context Learning for Pure Exploration
by: Russo, Alessio, et al.
Published: (2025)
by: Russo, Alessio, et al.
Published: (2025)
Testing Credibility of Public and Private Surveys through the Lens of Regression
by: Basu, Debabrota, et al.
Published: (2024)
by: Basu, Debabrota, et al.
Published: (2024)
Near Optimal Pure Exploration in Logistic Bandits
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)
Optimal Regret of Bernoulli Bandits under Global Differential Privacy
by: Azize, Achraf, et al.
Published: (2025)
by: Azize, Achraf, et al.
Published: (2025)
Dual-Directed Algorithm Design for Efficient Pure Exploration
by: Qin, Chao, et al.
Published: (2023)
by: Qin, Chao, et al.
Published: (2023)
Cost-Aware Optimal Pairwise Pure Exploration
by: Wu, Di, et al.
Published: (2025)
by: Wu, Di, et al.
Published: (2025)
In-Context Learning for Pure Exploration in Continuous Spaces
by: Russo, Alessio, et al.
Published: (2026)
by: Russo, Alessio, et al.
Published: (2026)
The Limits of Pure Exploration in POMDPs: When the Observation Entropy is Enough
by: Zamboni, Riccardo, et al.
Published: (2024)
by: Zamboni, Riccardo, et al.
Published: (2024)
UCB for Large-Scale Pure Exploration: Beyond Sub-Gaussianity
by: Li, Zaile, et al.
Published: (2025)
by: Li, Zaile, et al.
Published: (2025)
Online Preference Alignment for Language Models via Count-based Exploration
by: Bai, Chenjia, et al.
Published: (2025)
by: Bai, Chenjia, et al.
Published: (2025)
Similar Items
-
FraPPE: Fast and Efficient Preference-based Pure Exploration
by: Das, Udvas, et al.
Published: (2025) -
Pure Exploration in Bandits with Linear Constraints
by: Carlsson, Emil, et al.
Published: (2023) -
Differentially Private High Dimensional Bandits
by: Shukla, Apurv
Published: (2024) -
Vector preference-based contextual bandits under distributional shifts
by: Shukla, Apurv, et al.
Published: (2025) -
Learning to Explore with Lagrangians for Bandits under Unknown Linear Constraints
by: Das, Udvas, et al.
Published: (2024)