arXiv Machine Learning August 19, 2026 By Anh Tuan Nguyen, Viet Anh Nguyen

Tight Bounds for Data-driven Multiple Hyper-parameter Tuning with Structured Loss Function

Read the original on arXiv Machine Learning →

arXiv:2608. 17343v1 Announce Type: new Abstract: Data-driven algorithm design frames hyperparameter tuning as a statistical learning problem, but establishing generalization guarantees remains challenging due to the implicit, non-smooth dependence of model performance on hyperparameters.

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

arXiv Machine Learning

Jun 9

Parameter Tuning with Generalization Guarantees for GPU-Accelerated Linear Programming

arXiv:2606. 08638v1 Announce Type: cross Abstract: Recent research has developed practical, parallelizable first-order methods for large scale linear programming, but performance is highly dependent on hyperparameter selection.

By Siddharth Prasad, Dravyansh Sharma

benchmarks

arXiv Machine Learning

Jun 17

Tight $L_\infty$ Sample Complexity for Low-Degree and Sparse Boolean Polynomials

arXiv:2606. 17319v1 Announce Type: cross Abstract: Motivated by the optimization of bounded binary black-box functions, we study the problem of learning polynomial surrogates over the Boolean hypercube.

By Jasper van Doornmalen, Mathieu Molina, Victor Verdugo, Jos\'e Verschae

arXiv Machine Learning

Jul 27

Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates

arXiv:2607. 22467v1 Announce Type: new Abstract: Data scarcity poses a fundamental challenge in training generative models to produce initial guesses for parametric optimization problems that are otherwise numerically expensive to solve.

By Anjian Li, Ryne Beeson

arXiv Machine Learning

Jun 10

The hyper-scaled NLP bound for maximum-entropy remote sampling

arXiv:2601. 20970v3 Announce Type: replace-cross Abstract: The maximum-entropy remote sampling problem (MERSP) is to select a subset of $s$ random variables from a set of $n$ random variables, so as to maximize the information concerning a set of target random variables that are not directly observable.

By Gabriel Ponte, Marcia Fampa, Jon Lee

nlp benchmarks

arXiv AI

Jul 16

Uniform Approximation of Functions with Asymmetric Growth and Decay by Deep Weighted Polynomials

arXiv:2506. 21306v2 Announce Type: replace-cross Abstract: Functions that grow without bound on one side of the real line and decay to zero on the other cannot be approximated uniformly by ordinary polynomials on unbounded domains.

By Kingsley Yeon, Steven B. Damelin

fine-tuning

arXiv Machine Learning

6d ago

Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms

arXiv:2505. 23696v2 Announce Type: replace Abstract: Solving systems of polynomial equations, particularly those with finitely many solutions, is a crucial challenge across many scientific fields.

By Hiroshi Kera, Nico Pelleriti, Yuki Ishihara, Max Zimmer, Sebastian Pokutta

llms rag nlp

Related stories

Parameter Tuning with Generalization Guarantees for GPU-Accelerated Linear Programming

Tight $L_\infty$ Sample Complexity for Low-Degree and Sparse Boolean Polynomials

Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates

The hyper-scaled NLP bound for maximum-entropy remote sampling

Uniform Approximation of Functions with Asymmetric Growth and Decay by Deep Weighted Polynomials

Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms