arXiv Machine Learning August 4, 2026 By Petr Somol, Ji\v{r}\'{\i} Grim

Stochastic Sequential Search in Very-High-Dimensional Feature Selection

Read the original on arXiv Machine Learning →

arXiv:2608. 01502v1 Announce Type: new Abstract: Sequential subset search -- forward selection with floating backtracking and its descendants -- remains the quality reference in feature selection, but every member of the family sweeps the full pool of remaining candidate features at each step, which excludes it from very-high-dimensional problems; there, only individual-feature ranking remains practical, and it models feature interplay weakly or not at all.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 14

Rank-Conditioned Sample Reuse for the Plackett--Luce Best-of-$K$ Objective

arXiv:2607. 11146v1 Announce Type: new Abstract: We study the coupled objective J_K^WOR = E_{S ~ PL-WOR_K}[max_{i in S} R_i]: the expected maximum reward of a size-K Plackett-Luce draw without replacement, the law of Gumbel-Top-K / Stochastic Beam Search decoding.

By Melveena Jolly, Midhun Xavier

arXiv AI

Jul 28

Action from Adjacent Set in Physical Space Outperforms the Best Prediction in World Models

arXiv:2607. 23602v1 Announce Type: cross Abstract: Controllers based on sampling and latent world models assign a predicted terminal cost to each candidate action sequence, choose the minimum, execute its first action block, and replan.

By Liangyu Li, Qingwen Liu, Mingqing Liu

arXiv Machine Learning

Jul 13

Optimal Top-$k$ Identification from Pairwise Comparisons

arXiv:2607. 08979v1 Announce Type: new Abstract: We study the active learning problem of fixed-confidence top-$k$ identification from noisy pairwise comparisons.

By Motti Goldberger, Nils Rudi

reinforcement-learning

arXiv AI

Jul 14

Learning to Fine-tune Foundation Models under Resource Limitations

arXiv:2607. 10694v1 Announce Type: cross Abstract: We study the problem of optimal continual fine-tuning for a pre-trained Foundation Model deployed at a resource-limited device.

By Thomas Tsouparopoulos, Iordanis Koutsopoulos

nlp reinforcement-learning fine-tuning

arXiv Machine Learning

Aug 12

Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training

arXiv:2608. 11061v1 Announce Type: new Abstract: Large-scale neural recommender systems are typically trained with a softmax cross-entropy objective over the full item vocabulary.

By Artyom Sabitov, Daniil Volkov, Alexey Zaytsev

benchmarks

arXiv AI

Jun 29

When Is an LLM Worth It for Hyperparameter Optimization? A Budget-Matched Study on Tabular Data Finds the Warm-Start Is a Default Configuration, Not the Model

arXiv:2606. 21641v2 Announce Type: replace-cross Abstract: Large language models (LLMs) have been proposed as hyperparameter-optimization (HPO) advisors that "warm-start" search from prior knowledge, proposing strong configurations in very few evaluations.

By Carson Rodrigues, Oysturn Vas, Isaiah Abner DCosta, Nithish Kumar Prabhakaran

llms benchmarks

Related stories

Rank-Conditioned Sample Reuse for the Plackett--Luce Best-of-$K$ Objective

Action from Adjacent Set in Physical Space Outperforms the Best Prediction in World Models

Optimal Top-$k$ Identification from Pairwise Comparisons

Learning to Fine-tune Foundation Models under Resource Limitations

Batch Size or Negatives? A Selection Rule for Memory-Constrained Recommender Training

When Is an LLM Worth It for Hyperparameter Optimization? A Budget-Matched Study on Tabular Data Finds the Warm-Start Is a Default Configuration, Not the Model