[ICASSP'26] scalable, gradient-free optimizer for high-dimensional problems
-
Updated
May 7, 2026 - Python
[ICASSP'26] scalable, gradient-free optimizer for high-dimensional problems
Two-stage local method for query-efficient high-dimensional Bayesian optimization
High-dimensional sparse regression in R: penalized Huber, SVM, quantile, and Wilcoxon rank regression via the finite smoothing algorithm. Fast C++ (Rcpp) coordinate-descent kernels with elastic-net penalties, cross-validation, and SCAD/MCP non-convex penalties.
A memory-efficient, gradient-free zeroth-order (derivative-free) optimizer designed to solve the "Curse of Dimensionality" in Black-Box optimization and memory-constrained Machine Learning. It provides an O(log D) gradient estimation approach that can successfully train Neural Networks without ever calculating analytical derivatives or Backprop
Personal site: projects and notes on applied AI, statistics and high-dimensional data, and Product Management
To associate your repository with the high-dimensional-optimization topic, visit your repo's landing page and select "manage topics."