arXiv Machine Learning
Jun 16
Repeated Bilateral Trade: The Quest for Fairness
arXiv:2606. 15369v1 Announce Type: new Abstract: We study repeated bilateral trade from a fairness perspective.
Attribution Markets: A Fisher-Market Formulation for Fractional Credit Assignment Between Planned Tasks and Performed Actions
arXiv:2607. 20694v1 Announce Type: new Abstract: Personal and organizational planning systems maintain two records that drift apart: what was planned (a task's effort budget) and what was done (a logged action's duration and description).
Related stories
arXiv Machine Learning
Aug 24
Adaptive Inference for Resource-Constrained Dynamic Pricing
arXiv:2606. 03736v2 Announce Type: replace-cross Abstract: We study resource-constrained dynamic pricing when the seller seeks revenue and valid inference about demand at a price fixed before the selling season.
arXiv Machine Learning
Jun 3
Human-in-the-Loop Contextual Bandits for Short-Term Rental Dynamic Pricing: Structural Equivalence of Historical Warm-Up and Approval-Gated Live Learning
arXiv:2606. 02595v1 Announce Type: new Abstract: Dynamic pricing in short-term rental (STR) markets presents a distinctive challenge for online learning algorithms: pricing decisions carry significant financial risk, operators require explainability, and market feedback is sparse (one booking outcome per listed night).
arXiv Machine Learning
Sep 22
Plan-Driven Adaptive Bidding for First-Price Auctions with Budget Constraints under Nonstationarity
arXiv:2505.02796v3 Announce Type: replace-cross Abstract: We study budget pacing in repeated first-price auctions when an advertiser's private-value distributions change over time and the stationary...
arXiv Machine Learning
4d ago
Multi-Task Dynamic Pricing in Credit Market with Contextual Information
arXiv:2410.14839v5 Announce Type: replace-cross Abstract: We study the dynamic pricing problem faced by a broker seeking to learn prices for a large number of credit market securities, such as corpor...
arXiv Machine Learning
Aug 18
PRO-Bid: Pareto-Prioritized Regret Optimization for Constraint-Aware Generative Auto-Bidding
arXiv:2602. 08261v2 Announce Type: replace Abstract: Auto-bidding systems strive to maximize marketing value while maintaining high compliance with efficiency constraints, such as Target Cost-Per-Action (CPA).
arXiv Machine Learning
Aug 11
Regret, equilibrium, and learning in games: A guided tour
arXiv:2608. 09389v1 Announce Type: cross Abstract: This note aims to serve as an entry point to the literature on learning in games, a topic with significant theoretical appeal and a wide range of applications -- from machine learning and data science to economics and beyond.
arXiv AI
Sep 15
ReCAST: Reward Credit Assignment across Timesteps for Online Diffusion Reinforcement
ReCAST is a method for assigning credit to multiple rewards during diffusion model training by using a reward-by-timestep weight matrix that respects user-specified reward budgets while ensuring equal total weight per denoising step. It allocates weight based on each reward’s informativeness, measured by its Rényi discriminability gain at each step, allowing rewards to contribute more when they are most informative. Experiments on SD3.5‑Medium with two four‑reward settings show that ReCAST improves or matches training rewards, enhances held‑out judges, and is preferred by an independent LLM‑as‑a‑Judge, indicating generalizable benefits.
arXiv AI
Aug 11
Beyond Solvability: Task Learnability as a Static Prior for LLM RL Post-Training
arXiv:2608. 09217v1 Announce Type: cross Abstract: Reinforcement learning (RL) has become a central post-training paradigm for eliciting reasoning capabilities in large language models, yet uniform task sampling allocates compute without regard to differences in how tasks respond to optimization.
arXiv Machine Learning
Jun 30
Learning to Bid in Discriminatory Auctions with Budget Constraints
arXiv:2606. 29252v1 Announce Type: new Abstract: We study repeated bidding in multi-unit discriminatory (pay-as-bid) auctions for a single bidder with per-round utility equal to value minus $\alpha$ times payment, where $\alpha\in[0,1]$ is a cost-of-capital parameter.
arXiv Machine Learning
Jul 9
Best-Arm Identification with Generative Proxy
arXiv:2607. 06879v1 Announce Type: new Abstract: Best-arm identification is a canonical model for data-driven decision-making, but in many applications each reward observation is costly.
Hugging Face Trending Papers
Jun 13
Repeated Bilateral Trade: The Quest for Fairness
We study repeated bilateral trade from a fairness perspective. At each round, a fresh seller-buyer pair arrives, and the platform posts a price before observing the traders' valuations.