Skip to content
Preprint

BRiG-AFA: Bellman Risk-to-Go Learning for Non-Myopic Active Feature Acquisition

Aug 2026 · 0 citations · 12 references
Computer Science

TL;DR

A reproducible mechanism-level case for direct Bellman risk regression is established and the experiments still needed for state-of-the-art comparison are delimited, establishing a reproducible mechanism-level case for direct Bellman risk regression.

Abstract

Active feature acquisition (AFA) asks which unobserved feature to measure next for each test instance under a budget. Greedy rules are easy to train but can overlook context features whose value is realized only through later acquisitions, while reinforcement-learning and generative approaches introduce difficult optimization or conditional-density estimation. We introduce \method, a deployable, supervised alternative that learns a separate candidate-conditioned risk-to-go function for every remaining budget. Starting from the one-step terminal classification risk, the functions are fitted backward with Bellman targets; inference greedily minimizes the learned terminal risk using only observed values, the mask, candidate identity, and remaining budget. A controlled non-myopic benchmark shows the expected mechanism: at budgets two and three, \method improves accuracy over its one-step ablation by $4.84\pm2.17$ and $4.39\pm1.10$ percentage points (mean $\pm$ standard error over five seeds). On Fashion-MNIST with 20 candidate pixels, it improves accuracy at every nontrivial reported budget on average, including $10.20\pm0.74$ points at four acquisitions; its mean paired gain across budgets $\{2,4,8,12,16\}$ is $3.50\pm0.37$ points. A three-seed MiniBooNE study is mixed at small budgets but positive at 8 and 16 acquisitions, identifying a current boundary rather than supporting a universal claim. These results establish a reproducible mechanism-level case for direct Bellman risk regression and delimit the experiments still needed for state-of-the-art comparison.

View source

Similar papers

Preprint Aug 2026

Upper-Expectile Multi-Step Q-Learning for Off-Policy Reinforcement Learning

Using a single expectile level $\tau=0.8$ and a fixed backup horizon across 27 manipulation and navigation task instances, ENQ is competitive with LQL on aggregate, achieves higher measured training-step throughput in the authors' profiling study, and benefits more from a ten-critic ensemble in a controlled scaling exp...

Abdelghani Ghanem, Mounir Ghogho · 0 citations
Preprint Aug 2026

Adaptive Finite-Budget Training for CVaR Risk-Aware Q-Learning

Results demonstrate that adaptive finite-budget training design, applied solely to the training procedure without altering the risk objective, can materially improve the reliability and risk-adjusted performance of risk-aware Q-learning in financial applications.

Yifan Wu, Junjie Lei, Wenjie Huang · 0 citations
Preprint Aug 2026

Revisiting TD Target Aggregation under Uncertainty in Q-Learning

The proposed SADQ is a simple modification to Q-learning that regularizes how the TD target is formed, and consistently improves training stability across classical control tasks, real-world vector-based environments, and Atari benchmarks when compared to strong DQN variants.

Li-Peng Zu, Xiaonan Zhang · 0 citations
Preprint Aug 2026

ReBRAC-v2: The Return of the King

ReBRAC-v2 is introduced, which directly trains an exact-likelihood normalizing flow as the RL actor, combines likelihood, MSE, and MAE behavior regularization, and integrates a classification-based residual critic, staged optimization, and multi-sample test-time action selection, and ranks first in eight categories.

Denis Tarasov, Robert K. Katzschmann · 0 citations
Preprint Jul 2026

Branch-JEPA: Finite-Support Predictive Distributions for JEPA World Models

Branch-JEPA is introduced, which replaces this point-valued transition with a context-weighted finite set of latent successors, and preserves more distinct futures, while full-set scoring improves the quality of the resulting predictive distribution.

Zhi Song, Ximing Xing, Zhenchao Tang et al. · 0 citations
#artificial intelligence Preprint Aug 2026

BCPPO: Bachelier-Inspired Constrained Proximal Policy Optimization for Tail-Risk-Aware Safe Reinforcement Learning

BCPPO (Bachelier-Inspired Constrained Proximal Policy Optimization), a proximal policy optimization (PPO) method, supports a practical balance among reward, caution around cost predictions that vary across trained critics, and policy-only deployment.

Dong-Sheng Hou, Yan-Qiao Chen, Yu-Han Rui · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.