← Search

William de Vazelhes

7 accepted papers

2025

Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees

ICML 2025poster

In sparse optimization, enforcing hard constraints using the $\ell_0$ pseudo-norm offers advantages like controlled sparsity compared to convex relaxations. However, many real-world applications demand not only sparsity constraints but also some extra constraints. While prior algorithms have been d…

2024

Hard-Thresholding Meets Evolution Strategies in Reinforcement Learning

IJCAI 2024poster

Evolution Strategies (ES) have emerged as a competitive alternative for model-free reinforcement learning, showcasing exemplary performance in tasks like Mujoco and Atari. Notably, they shine in scenarios with imperfect reward functions, making them invaluable for real-world applications where dense…

2024

Iterative Regularization with k-support Norm: An Important Complement to Sparse Recovery

AAAI 2024technical

Sparse recovery is ubiquitous in machine learning and signal processing. Due to the NP-hard nature of sparse recovery, existing methods are known to suffer either from restrictive (or even unknown) applicability conditions, or high computational cost. Recently, iterative regularization methods have…

2024

Limited Memory Online Gradient Descent for Kernelized Pairwise Learning with Dynamic Averaging

AAAI 2024technical

Pairwise learning, an important domain within machine learning, addresses loss functions defined on pairs of training examples, including those in metric learning and AUC maximization. Acknowledging the quadratic growth in computation complexity accompanying pairwise loss as the sample size grows, r…

Cited by 0SourcePDFScholar
2024

New Insight of Variance reduce in Zero-Order Hard-Thresholding: Mitigating Gradient Error and Expansivity Contradictions

ICLR 2024poster

Hard-thresholding is an important type of algorithm in machine learning that is used to solve $\ell_0$ constrained optimization problems. However, the true gradient of the objective function can be difficult to access in certain scenarios, which normally can be approximated by zeroth-order (ZO) met…

Cited by 1SourcePDFScholar
2023

Direct Training of SNN using Local Zeroth Order Method

NeurIPS 2023poster

Spiking neural networks are becoming increasingly popular for their low energy requirement in real-world tasks with accuracy comparable to traditional ANNs. SNN training algorithms face the loss of gradient information and non-differentiability due to the Heaviside function in minimizing the model l…

2022

Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity

NeurIPS 2022accept

$\ell_0$ constrained optimization is prevalent in machine learning, particularly for high-dimensional problems, because it is a fundamental approach to achieve sparse learning. Hard-thresholding gradient descent is a dominant technique to solve this problem. However, first-order gradients of the obj…

Cited by 7SourcePDFScholar