← Search

Santiago Paternain

7 accepted papers

2025

DISC: Dynamic Decomposition Improves LLM Inference Scaling

NeurIPS 2025poster

Inference scaling methods for LLMs often rely on decomposing problems into steps (or groups of tokens), followed by sampling and selecting the best next steps. However, these steps and their sizes are often predetermined or manually designed based on domain knowledge. We propose dynamic decompositio…

Cited by 0SourceScholar
2024

A Method for Bilevel Optimization with Convex Lower-Level Problem

ICASSP 2024accepted

Gradient-based bilevel optimization methods have been applied to a wide range of applications including hyper-parameter optimization, meta-learning, and model pruning. However, it is known that the bilevel optimization problem is difficult to solve, and the finite-time guarantee has only been establ…

Cited by 0SourceScholar
2024

Fast and Accurate Relative Motion Tracking for Dual Industrial Robots

RA-L 2024

Industrial robotic applications such as spraying, welding, and additive manufacturing frequently require fast, accurate, and uniform motion along a 3D spatial curve. To increase process throughput, some manufacturers propose a dual-arm setup to overcome the speed limitation of a single robot. Indust

Cited by 4SourceScholar
2020

The Empirical Duality Gap of Constrained Statistical Learning

ICASSP 2020accepted

This paper is concerned with the study of constrained statistical learning problems, the unconstrained version of which are at the core of virtually all of modern information processing. Accounting for constraints, however, is paramount to incorporate prior knowledge and impose desired structural an…

Cited by 0SourceScholar
2019

Constrained Reinforcement Learning Has Zero Duality Gap

NeurIPS 2019poster

Autonomous agents must often deal with conflicting requirements, such as completing tasks using the least amount of time/energy, learning multiple tasks, or dealing with multiple opponents. In the context of reinforcement learning~(RL), these problems are addressed by (i)~designing a reward function…

Cited by 237SourcePDFScholar
2019

Sparse Learning of Parsimonious Reproducing Kernel Hilbert Space Models

ICASSP 2019accepted

Reproducing kernel ilbert spaces (RKHSs) have been at the core of successful non-parametric tools in signal processing, statistics, and machine learning. Despite their success, the computational complexity of these models often hinders their use in practice. Indeed, fitting RKHS models typically rel…

Cited by 0SourceScholar