arXiv Machine Learning July 10, 2026 By Tingyang Wei, Jiao Liu, Abhishek Gupta, Puay Siew Tan, Yew-Soon Ong

($\theta_l, \theta_u$)-Parametric Multi-Task Optimization: Joint Search in Solution and Infinite Task Spaces

Read the original on arXiv Machine Learning →

arXiv:2503. 08394v5 Announce Type: replace-cross Abstract: Multi-task optimization is typically characterized by a fixed and finite set of tasks.

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

robotics

arXiv AI

Jun 11

Pass@K Policy Optimization: Solving Harder Reinforcement Learning Problems

arXiv:2505. 15201v5 Announce Type: replace-cross Abstract: Reinforcement Learning (RL) algorithms sample multiple n>1 solution attempts for each problem and reward them independently.

By Christian Walder, Deep Karkhanis

llms reinforcement-learning

arXiv Machine Learning

Jun 2

GLENS: Global Search via Learning from Solver Iterates with Diffusion Models

arXiv:2606. 00366v1 Announce Type: new Abstract: We consider the problem of generating a large collection of initial guesses for local minima of multimodal non-convex continuous optimization problems.

By Anjian Li, Bartolomeo Stellato, Ryne Beeson

diffusion robotics multimodal benchmarks

arXiv Machine Learning

Jun 25

Bias-Controlled Primal-Dual Natural Actor-Critic: Optimal Rates for Constrained Multi-Objective Average-Reward RL

arXiv:2606. 25012v1 Announce Type: new Abstract: Many reinforcement learning (RL) problems in the infinite-horizon average-reward setting require optimizing multiple conflicting objectives while satisfying multiple safety constraints.

By Ankur Naskar, Swetha Ganesh, Vaneet Aggarwal

agents reinforcement-learning safety

arXiv Machine Learning

Aug 6

GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMs

arXiv:2606. 23299v2 Announce Type: replace Abstract: Configuring the hyperparameters of Mixed-integer programming (MIP) solvers is a high-dimensional, instance-dependent optimization problem where suboptimal settings can degrade solving time by orders of magnitude.

By Yidong Luo, Xuemin Chen, Chenguang Wang, Fangzhou Zhu, Tao Zhong, Tianshu Yu

llms benchmarks

arXiv AI

Jun 10

Structure from Reasoning, Numbers from Search: On-Premise Open LLMs as Structural Priors for Coupled MIMO Controller Tuning

arXiv:2606. 11015v1 Announce Type: new Abstract: Tuning controllers for strongly coupled multi-input multi-output (MIMO) industrial processes is hard: decentralized classical auto-tuning ignores loop interaction, and local numerical optimization from natural initializations stalls in the resulting non-convex cost landscape.

By Jiaxuan Chen, Haonan Li, Yang Shu

llms benchmarks safety

arXiv AI

Jun 8

Neuro-Symbolic Learning for Long-Horizon Task Planning Under Complex Logical Constraints

arXiv:2606. 06877v1 Announce Type: cross Abstract: Task planning often suffers from severe efficiency bottlenecks when robots must reason over long-horizon action sequences under complex logical constraints, including object affordances, spatial relationships, and sequential action dependencies.

By Qiwei Du, Zitong Zhan, Shaoshu Su, Bowen Li, Yi Du, Zhipeng Zhao, Taimeng Fu, Sebastian Scherer, Jiaoyang Li, Chen Wang

robotics benchmarks safety

Related stories

Pass@K Policy Optimization: Solving Harder Reinforcement Learning Problems

GLENS: Global Search via Learning from Solver Iterates with Diffusion Models

Bias-Controlled Primal-Dual Natural Actor-Critic: Optimal Rates for Constrained Multi-Objective Average-Reward RL

GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMs

Structure from Reasoning, Numbers from Search: On-Premise Open LLMs as Structural Priors for Coupled MIMO Controller Tuning

Neuro-Symbolic Learning for Long-Horizon Task Planning Under Complex Logical Constraints