Gradient-free optimization for additive models achieves optimal error.
problem Optimizing noisy functions with zero-order information.
method Proposed a randomized gradient estimator for gradient-free optimization.
result Achieves minimax optimal error of order dT−(β−1)/β. Modern neural networks are highly non-robust against adversarial manipulation. A significant amount of work has been invested in techniques to compute lower bounds on robustness through formal guarantees and to build provably robust models. However, it is still difficult to get guarantees for larger networks or robustn…
Gradient-free method solves infinite-dimensional optimization problems.
problem Optimizing functions in infinite-dimensional spaces.
method Uses directional derivatives and a pre-basis for Hilbert space.
result Proves convergence for solving PDEs using PINNs.
RSO uses random weight perturbations to train deep networks without gradients.
problem Training deep neural networks efficiently and without gradient information.
method RSO is a gradient-free Markov Chain Monte Carlo approach that updates weights based on mini-batch loss reduction.
result RSO achieves high accuracy (99.1% on MNIST) with significantly fewer updates than traditional methods.
New method optimizes hyperparameters for randomized algorithms like random feature regression.
problem Optimizing hyperparameters in randomized algorithms is challenging due to their stochastic nature.
method Introduced a random objective function and used ensemble Kalman inversion (EKI) for gradient-free optimization.
result Demonstrated successful optimization of hyperparameters in various randomized algorithms.
Gradient-free optimizers are ineffective on barren plateaus in quantum computing.
problem Effect of barren plateaus on gradient-free optimization in quantum computing.
method Numerical simulations and theoretical analysis of gradient-free optimization algorithms.
result Gradient-free optimizers are not effective in barren plateau landscapes due to exponentially suppressed cost function differences.
A faster method for estimating effects in large data using fixed-point trees.
problem Estimating heterogeneous effects in large dimensions with computational efficiency.
method Fixed-point approximation to eliminate Jacobian estimation and speed up GRFs.
result Significant computational efficiency improvement without sacrificing statistical accuracy.
ENN uses covariance matrices for gradient-free optimization in neural networks.
problem Efficiently optimizing neural networks without gradient calculations.
method Ensemble Neural Networks (ENN) with EnRML algorithm.
result ENN outperforms traditional BNNs and is robust to small datasets.
Gradient-free ensemble learns sector forecasts from diverse models.
problem Predicting sector returns in a volatile market.
method Dynamic model combination using out-of-sample R-squared.
result Ensemble outperforms individual models in sector rotation.
Improved analysis and new algorithm for gradient-free optimization of smooth functions.
problem Minimization of highly smooth functions with noisy oracle information.
method Two zero-order projected gradient descent algorithms based on randomization over the ℓ2 and ℓ1 spheres, with improved analysis and theoretical guarantees. result Improved convergence rates and theoretical guarantees for various function classes.
Amazon SageMaker AMT automates machine learning model tuning.
problem Challenging hyperparameter tuning for complex machine learning systems.
method Gradient-free optimization using random search or Bayesian optimization.
result AMT finds the best hyperparameter configurations for models.
Improves black-box adversarial attacks with a transfer-based prior.
problem Low attack success rates and poor query efficiency in black-box adversarial attacks.
method P-RGF method that integrates a transfer-based prior and query information.
result Significantly reduces the number of queries needed for successful attacks.
Gradient-free framework for Bayesian experimental design in complex systems.
problem Optimal experimental design in systems where gradient information is unavailable.
method Combines EKI and ALDI for optimization and sampling, with approximations for scalable utility estimation.
result Demonstrates robust, accurate, and efficient experimental design in various complex systems.
We propose Kernel Hamiltonian Monte Carlo (KMC), a gradient-free adaptive MCMC algorithm based on Hamiltonian Monte Carlo (HMC). On target densities where classical HMC is not an option due to intractable gradients, KMC adaptively learns the target's gradient structure by fitting an exponential family model in a Reprod…
Gradient-free deep learning for large datasets.
problem Training deep neural networks on large-scale datasets is resource-intensive and requires specialized techniques.
method Recursive Local Representation Alignment (RLRA) for gradient-free training.
result RLRA achieves comparable performance to backprop while converging faster and being parallelizable.
Paper tackles gradient-free minimax optimization with variance reduction for faster convergence.
problem Gradient-free minimax optimization problems in machine learning.
method Variance reduction technique to design a novel zeroth-order gradient descent ascent algorithm.
result Achieves the best known query complexity of O(κ(d₁ + d₂)ε⁻³), outperforming previous methods.
New methods improve black-box adversarial attacks with fewer queries.
problem Efficiently craft adversarial examples without access to gradients.
method Prior-guided random gradient-free algorithms based on biased sampling and gradient averaging.
result Both methods require fewer queries and achieve higher success rates.
Gradient-free method improves predictive accuracy for probabilistic models.
problem Balancing computational efficiency and robust predictive performance in deep learning.
method CAVI-CMN, a gradient-free variational method for conditional mixture networks.
result CAVI-CMN achieves competitive and often superior predictive accuracy compared to MLE with backpropagation.
New sampling method uses gradient-free IPS with RKHS velocity field.
problem Efficient sampling from unnormalized target densities.
method Gradient-free interacting particle systems (IPS) with RKHS velocity field.
result IPS produce high-quality samples from various target distributions.
Paper proposes MCTSPO for better reinforcement learning policy optimization.
problem Local optima and saddle points in gradient-based methods and poor initialization in gradient-free methods.
method Monte-Carlo tree search combined with gradient-free optimization.
result Improved performance on reinforcement learning tasks with deceptive or sparse reward functions.
STRATA generates code adversarial examples efficiently without gradients.
problem Generating adversarial examples for code that retains functional meaning.
method Uses token frequency statistics to construct gradient-free adversarial examples.
result Empirically outperforms gradient-based methods with less information and effort.
G-Sim uses LLMs to build reliable simulators for complex systems.
problem Building robust simulators for critical domains like healthcare and logistics is challenging.
method Hybrid framework combining LLM-driven structural design and empirical calibration.
result G-Sim produces reliable, causally-informed simulators that handle non-differentiable and stochastic simulators.
Monte Carlo method trains deep neural networks without gradients.
problem Vanishing and exploding gradients in backpropagation.
method Randomly mutate parameters, keep if loss decreases.
result Gradient-free method trains deep networks effectively.
New method optimizes black-box functions using generative models and Wasserstein distance.
problem Optimizing black-box functions with stochastic responses in high dimensions.
method Deep generative surrogate models and Wasserstein distance for uncertainty estimation.
result Method outperforms state-of-the-art methods in robustness to function shape and stochasticity.
Iterative tilting fine-tunes diffusion models for reward-tilted distributions.
problem Fine-tuning diffusion models for reward-tilted distributions.
method Decomposes large reward tilts into smaller, tractable tilts via first-order Taylor expansion, avoiding backpropagation.
result Validated on a two-dimensional Gaussian mixture, achieving exact closed-form solutions.
CPS solves inverse problems using forward passes and constrained particle seeking.
problem Solving inverse problems with limited forward observation information.
method Gradient-free approach that reformulates inverse problem as constrained optimization.
result CPS achieves results comparable to gradient-based methods while outperforming alternatives.
FAKI improves gradient-free inference for inverse problems.
problem Expensive forward models without gradients.
method Temperature annealing with normalizing flows.
result Dramatic improvements in accuracy over EKI.
This paper analyzes and guarantees convergence of prior-guided ZO algorithms.
problem Understanding convergence properties of prior-guided zeroth-order optimization algorithms.
method Analysis of convergence under a greedy descent framework with various gradient estimators, and development of ARS algorithm.
result Convergence guarantee for prior-guided random gradient-free (PRGF) algorithms and accelerated random search (ARS) algorithm.
StarNet trains deep models without gradients using linear equations.
problem Training deep generative models with gradients.
method Solving determined systems of linear equations.
result Least-square bounds for latent codes and model parameters.
New method reduces variance in random coordinate descent for Langevin Monte Carlo.
problem Efficient sampling from log-concave distributions in high dimensions.
method Introduces RCAD, a variance reduction technique for RCD-LMC.
result RCAD-O-LMC and RCAD-U-LMC converge within the same number of iterations as classical LMC methods, saving computational cost.
SMTM improves MCMC sampling in high dimensions with multiple proposals and stereographic integration.
problem Improving MCMC performance in high-dimensional sampling.
method Integrating multiple-try Metropolis with stereographic MCMC framework.
result SMTM outperforms classical MTM and other methods in high-dimensional sampling.
ZO-AdaMM adapts AdaMM for gradient-free optimization.
problem Optimizing black-box functions without explicit gradients.
method Zeroth-order AdaMM, generalizing AdaMM to gradient-free settings.
result ZO-AdaMM converges faster to high-accuracy solutions.
Simplifies generating inspired images from deep models.
problem Lack of tools to quickly generate inspired images from deep models.
method Optimization method to find optimal latent parameters.
result Effective retrieval of inspired images in most cases.
This paper reviews zeroth-order optimization in signal processing and machine learning.
problem Optimization problems without gradient information.
method Iterative steps: gradient estimation, descent direction computation, solution update.
result Demonstrates applications in robustness evaluation and black-box model explanations.
Stein variational gradient decent (SVGD) has been shown to be a powerful approximate inference algorithm for complex distributions. However, the standard SVGD requires calculating the gradient of the target density and cannot be applied when the gradient is unavailable. In this work, we develop a gradient-free variant …
ESS-Flow guides flow models without retraining, using Bayesian inference in source space.
problem Training flow models on paired data for conditional generation or sample production.
method Gradient-free Bayesian inference in source space using Elliptical Slice Sampling.
result Effective in diverse tasks including material design and protein structure prediction.
Quantum kernel improves probabilistic time series forecasting.
problem Quantifying uncertainty in probabilistic time series predictions.
method Integrates quantum kernel with Gaussian process regression.
result Quantum kernel enhances forecasting performance.
We study the problem of attacking a machine learning model in the hard-label black-box setting, where no model information is revealed except that the attacker can make queries to probe the corresponding hard-label decisions. This is a very challenging problem since the direct extension of state-of-the-art white-box at…
TaskNorm improves meta-learning performance by rethinking batch normalization.
problem Challenges in batch normalization for meta-learning with deep networks.
method Developed TaskNorm, a novel approach to batch normalization for meta-learning.
result TaskNorm consistently improves meta-learning performance across various datasets and meta-learning approaches.
GRAFFL learns Bayesian models without gradients for federated learning.
problem Privacy protection in federated learning during gradient updates.
method Gradient-free approach using summary statistics from SuffiAE.
result Feasibility and usefulness demonstrated in Gaussian mixture model.
Post-hoc explanations improve CNNs by replacing final linear layer with k-means classifier.
problem CNNs lack accurate data representation in their built-in prototypes.
method Introduces k-means-based post-hoc explanations for CNNs, leveraging spatial consistency of convolutional receptive fields.
result Using shallower, less compressed feature activations improves semantic fidelity at the cost of slight predictive performance.
A new neural network framework avoids iterations and achieves fast, low-error predictions.
problem Training neural networks efficiently and avoiding overfitting.
method Gradient-free approach based on Universal Approximation Theorem, using local approximation matrices.
result Highly accurate predictions on complex datasets, including the Griewank function and MNIST.
NES optimizes discrete structured VAEs effectively without gradient propagation.
problem Learning high-dimensional discrete latent spaces in generative models.
method Natural Evolution Strategies (NES) for gradient-free optimization of discrete structures.
result NES effectively optimizes discrete structured VAEs, comparable to gradient-based methods.
Gradient-free method reduces dimensionality without gradients for expensive models.
problem Reducing high-dimensional input spaces for expensive models without gradient information.
method Fully Bayesian, gradient-free approach using Gaussian processes.
result Improves active subspace recovery and probabilistic prediction accuracy with limited data.
In this article, we show that solving the system of linear equations by manipulating the kernel and the range space is equivalent to solving the problem of least squares error approximation. This establishes the ground for a gradient-free learning search when the system can be expressed in the form of a linear matrix e…
Electrostatics method samples complex distributions deterministically.
problem Sampling and inference of complex, high-dimensional distributions.
method Electrostatics-based particle system with Newton mechanics principles.
result Method achieves comparable performance to other methods in benchmark tasks.
Method designs lightweight, structurally robust shell objects.
problem Designing lightweight, structurally robust shell objects under external forces.
method Shape parametrization based on Laplace's equation for smooth, intersection-free boundaries; gradient-free optimization algorithm.
result Practical solution to structural design of hollow objects with single inner cavity.
New algorithms minimize noisy, irregular functions without gradients.
problem Minimizing noisy, irregular, and algebraically intractable functions.
method Generalized gradient descent recursion with smooth approximations.
result Convergence results under weak assumptions on function regularity.