← Search

Felipe Llinares-López

7 accepted papers

2025

Implicit Diffusion: Efficient optimization through stochastic sampling

AISTATS 2025oral

Sampling and automatic differentiation are both ubiquitous in modern machine learning. At its intersection, differentiating through a sampling operation, with respect to the parameters of the sampling process, is a problem that is both challenging and broadly applicable. We introduce a general frame…

Cited by 0SourceScholar
2024

Decoding-time Realignment of Language Models

ICML 2024spotlight

Aligning language models with human preferences is crucial for reducing errors and biases in these models. Alignment techniques, such as reinforcement learning from human feedback (RLHF), are typically cast as optimizing a tradeoff between human preference rewards and a proximity regularization term…

Cited by 33SourcePDFScholar
2023

Differentiable Clustering with Perturbed Spanning Forests

NeurIPS 2023poster

We introduce a differentiable clustering method based on stochastic perturbations of minimum-weight spanning forests. This allows us to include clustering in end-to-end trainable pipelines, with efficient gradients. We show that our method performs well even in difficult settings, such as data sets…

2022

Efficient and Modular Implicit Differentiation

NeurIPS 2022accept

Automatic differentiation (autodiff) has revolutionized machine learning. It allows to express complex computations by composing elementary ones in creative ways and removes the burden of computing their derivatives by hand. More recently, differentiation of optimization problem solutions has attra…

2022

Learning Energy Networks with Generalized Fenchel-Young Losses

NeurIPS 2022accept

Energy-based models, a.k.a. energy networks, perform inference by optimizing an energy function, typically parametrized by a neural network. This allows one to capture potentially complex relationships between inputs and outputs. To learn the parameters of the energy function, the solution to that…

Cited by 12SourcePDFScholar
2019

Wasserstein Weisfeiler-Lehman Graph Kernels

NeurIPS 2019spotlight

Most graph kernels are an instance of the class of R-Convolution kernels, which measure the similarity of objects by comparing their substructures. Despite their empirical success, most graph kernels use a naive aggregation of the final set of substructures, usually a sum or average, thereby potenti…

2016

Finding significant combinations of features in the presence of categorical covariates

NeurIPS 2016poster

In high-dimensional settings, where the number of features p is typically much larger than the number of samples n, methods which can systematically examine arbitrary combinations of features, a huge 2^p-dimensional space, have recently begun to be explored. However, none of the current methods is a…