arXiv Statistics ML
Approximate Universal Prediction under Interaction
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Jul 3
Prediction Sets for Counterfactual Decisions: Coverage, Optimality, and Conformal Prediction
arXiv:2607. 02206v1 Announce Type: cross Abstract: Predictions are increasingly used to guide high-stakes decisions, from treatment selection to policy making.
arXiv Machine Learning
Sep 30
Nonpreemptive Scheduling While Learning Context-Dependent Service Rates
arXiv:2609.37660v1 Announce Type: new Abstract: We study nonpreemptive contextual queueing bandits in a single-server system. Each job is represented by a $d$-dimensional context vector; in each roun...
arXiv Machine Learning
Oct 22
Learning to Allocate Resources with Censored Feedback
The paper addresses an online resource allocation problem where a budget must be distributed among multiple arms under censored feedback. Each arm yields a reward only if it is activated by an unknown Bernoulli process and the allocated budget exceeds a random threshold from an unknown parametric distribution. The authors establish a worst‑case regret lower bound of Σ(√T), propose the RA‑UCB algorithm achieving near‑optimal regret when the budget is known, and introduce MG‑UCB for unknown, round‑dependent budgets, validating both approaches experimentally.
arXiv Machine Learning
Oct 22
Approximate Solomonoff Induction: On the Robustness of Learned Universal Predictors
The paper investigates how well practical machine‑learning algorithms approximate Solomonoff’s universal predictor when trained by minimizing log‑loss over diverse datasets. It establishes tight bounds on the worst‑case increase in prediction error caused by approximating the Bayesian mixture predictor, showing that while the excess error can be large in low‑prior environments, it remains bounded on average and under distribution shifts. The authors also extend their analysis to finite‑sample settings relevant to neural networks and Transformers.
arXiv Machine Learning
Oct 3
Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness
arXiv:2610. 01377v1 Announce Type: new Abstract: We study causal logistic bandits with counterfactual fairness constraints.
arXiv Machine Learning
Aug 14
Chance-constrained selection of sequential intervention strategies from counterfactual estimates
arXiv:2608. 13209v1 Announce Type: cross Abstract: Many operational decisions are sequences of interventions under a cumulative resource limit, such as a maintenance schedule within a crew-hour budget.