Copertina

Online Bidding under RoS Constraints without Knowing the Value

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Vijayan, Sushant, Feng, Zhe, Padmanabhan, Swati, Shanmugam, Karthikeyan, Suggala, Arun, Wang, Di
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
di: Vijayan, Sushant, et al.
Pubblicazione: (2025)

RoS-Guard: Robust and Scalable Online Change Detection with Delay-Optimal Guarantees
di: Zhu, Zelin, et al.
Pubblicazione: (2025)

Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program
di: Dasgupta, Arpan, et al.
Pubblicazione: (2024)

Towards minimax optimal algorithms for Active Simple Hypothesis Testing
di: Vijayan, Sushant
Pubblicazione: (2025)

Offline-to-online hyperparameter transfer for stochastic bandits
di: Sharma, Dravyansh, et al.
Pubblicazione: (2025)

Mechanism Design via Market Clearing-Prices for Value Maximizers under Budget and RoS Constraints
di: Liu, Xiaodong, et al.
Pubblicazione: (2026)

CDQuant: Greedy Coordinate Descent for Accurate LLM Quantization
di: Nair, Pranav Ajit, et al.
Pubblicazione: (2024)

Improving Generalization via Meta-Learning on Hard Samples
di: Jain, Nishant, et al.
Pubblicazione: (2024)

Robust Reward Modeling via Causal Rubrics
di: Srivastava, Pragya, et al.
Pubblicazione: (2025)

Safe Online Bid Optimization with Return on Investment and Budget Constraints
di: Castiglioni, Matteo, et al.
Pubblicazione: (2022)

Selective classification using a robust meta-learning approach
di: Jain, Nishant, et al.
Pubblicazione: (2022)

Glauber Generative Model: Discrete Diffusion Models via Binary Classification
di: Varma, Harshit, et al.
Pubblicazione: (2024)

First-Order Methods for Linearly Constrained Bilevel Optimization
di: Kornowski, Guy, et al.
Pubblicazione: (2024)

Second Order Methods for Bandit Optimization and Control
di: Suggala, Arun, et al.
Pubblicazione: (2024)

Representation Learning Preserving Ignorability and Covariate Matching for Treatment Effects
di: Nanavati, Praharsh, et al.
Pubblicazione: (2025)

Interleaved Gibbs Diffusion: Generating Discrete-Continuous Data with Implicit Constraints
di: Anil, Gautham Govind, et al.
Pubblicazione: (2025)

Efficient Public Health Intervention Planning Using Decomposition-Based Decision-Focused Learning
di: Shah, Sanket, et al.
Pubblicazione: (2024)

Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD
di: Das, Aniket, et al.
Pubblicazione: (2024)

On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization
di: Kornowski, Guy, et al.
Pubblicazione: (2024)

Stochastic Re-weighted Gradient Descent via Distributionally Robust Optimization
di: Kumar, Ramnath, et al.
Pubblicazione: (2023)

Fairness under Covariate Shift: Improving Fairness-Accuracy tradeoff with few Unlabeled Test Samples
di: Havaldar, Shreyas, et al.
Pubblicazione: (2023)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
di: Vaze, Rahul, et al.
Pubblicazione: (2025)

Does Safety Training of LLMs Generalize to Semantically Related Natural Prompts?
di: Addepalli, Sravanti, et al.
Pubblicazione: (2024)

General Identifiability and Achievability for Causal Representation Learning
di: Varıcı, Burak, et al.
Pubblicazione: (2023)

Bandits with Mean Bounds
di: Sharma, Nihal, et al.
Pubblicazione: (2020)

Linear Causal Representation Learning from Unknown Multi-node Interventions
di: Varıcı, Burak, et al.
Pubblicazione: (2024)

One Model, Two Markets: Bid-Aware Generative Recommendation
di: Jiang, Yanchen, et al.
Pubblicazione: (2026)

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
di: Wang, Yige, et al.
Pubblicazione: (2025)

Generative Auto-Bidding with Value-Guided Explorations
di: Gao, Jingtong, et al.
Pubblicazione: (2025)

HALO: Hindsight-Augmented Learning for Online Auto-Bidding
di: Dong, Pusen, et al.
Pubblicazione: (2025)

Efficient Approximate Posterior Sampling with Annealed Langevin Monte Carlo
di: Parulekar, Advait, et al.
Pubblicazione: (2025)

Path-specific effects for pulse-oximetry guided decisions in critical care
di: Zhang, Kevin, et al.
Pubblicazione: (2025)

Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
di: Sharma, Nihal, et al.
Pubblicazione: (2021)

Score-based Causal Representation Learning: Linear and General Transformations
di: Varıcı, Burak, et al.
Pubblicazione: (2024)

Learning-Augmented Online Bidding in Stochastic Settings
di: Angelopoulos, Spyros, et al.
Pubblicazione: (2025)

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
di: Tatlı, Meltem, et al.
Pubblicazione: (2025)

Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
di: Tatlı, Meltem, et al.
Pubblicazione: (2025)

Attribute Graphs Underlying Molecular Generative Models: Path to Learning with Limited Data
di: Hoffman, Samuel C., et al.
Pubblicazione: (2022)

Online Budgeted Matching with General Bids
di: Yang, Jianyi, et al.
Pubblicazione: (2024)

Learning to Bid with Unknown Private Values in Budget-Constrained First-Price Auctions
di: Hu, Zihao, et al.
Pubblicazione: (2026)