No article text was recorded for this version.
noisy objective functions
Version 2 of 2384 papers450 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A benchmark of kriging-based infill criteria for noisy optimization
- Blog: Differential Evolution for Strongly Noisy Optimization: Use 1.01$^n$ Resamplings at Iteration n and Reach the -1/2 Slope
- Blog: Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
- Blog: Meta online learning: experiments on a unit commitment problem
- Blog: Handling Expensive Optimization with Large Noise
- Blog: OrthoBO: Orthogonal Bayesian Hyperparameter Optimization
- Blog: A New Knowledge Gradient-based Method for Constrained Bayesian Optimization
- Blog: First- and second-order high probability complexity bounds for trust-region methods with noisy oracles
- Blog: Soft quasi-Newton: guaranteed positive definiteness by relaxing the secant constraint
- Blog: A Novel Human-Based Meta-Heuristic Algorithm: Dragon Boat Optimization
- Blog: GRADIENT-BASED STOCHASTIC OPTIMIZATION METHODS IN BAYESIAN EXPERIMENTAL DESIGN
- Blog: M2ICAL Analyses HC-Gammon
- Blog: Set-Valued Regression and Cautious Suboptimization: From Noisy Data to Optimality
- Blog: Multi-Objective Hyperparameter Optimization - An Overview
- Blog: Secant Penalized BFGS: A Noise Robust Quasi-Newton Method Via Penalizing The Secant Condition
- Blog: A Novel Surrogate-assisted Evolutionary Algorithm Applied to Partition-based Ensemble Learning
- Blog: Analysis of Different Types of Regret in Continuous Noisy Optimization
- Blog: Golem: An algorithm for robust experiment and process optimization
- Blog: A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization
- Blog: Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis
- Blog: Faster, Cheaper, Better: Multi-Objective Hyperparameter Optimization for LLM and RAG Systems
- Blog: Personalized Bayesian optimization for noisy problems
- Blog: Simulation Optimization of the Crossdock Door Assignment Problem
- Blog: On the construction of probabilistic Newton-type algorithms
- Blog: Surrogate-assisted evolutionary algorithms for expensive combinatorial optimization: a survey
- Blog: Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement
- Blog: Intermediate Gradient Methods with Relative Inexactness
- Blog: Anomalies in the Behaviour of a Modularity Inducing Problem Domain
- Blog: A Sequential Quadratic Programming Method With High-Probability Complexity Bounds for Nonlinear Equality-Constrained Stochastic Optimization
- Blog: Benchmark tasks for Quality-Diversity applied to Uncertain domains
- Blog: An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization
- Blog: Criteria and Convergence Rates in Noisy Optimization
- Blog: Information-Theoretic Bounds for Integral Estimation
- Blog: Tradeoffs Between Convergence Rate and Noise Amplification for Momentum-Based Accelerated Optimization Algorithms
- Blog: Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise
- Blog: Algorithm Portfolios for Noisy Optimization
- Blog: Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise
- Blog: Pareto Optimization with Robust Evaluation for Noisy Subset Selection
- Blog: A Resilience Framework for Bi-Criteria Combinatorial Optimization with Bandit Feedback
- Blog: Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
- Blog: Classification and Bayesian Optimization for Likelihood-Free Inference
- Blog: Bayesian Optimization with Expected Improvement: No Regret and the Choice of Incumbent
- Blog: Anomalies in the Behaviour of a Modularity Inducing Problem Domain
- Blog: Optimal Bayesian design for model discrimination via classification
- Blog: Algorithm portfolios for noisy optimization
- Blog: A Unified Analysis of First-Order Methods for Smooth Games via Integral Quadratic Constraints
- Blog: Three-Point Method with Zero-Order Oracle that Inexactly and Randomly Compares Function Values
- Blog: On the Robustness of Median Sampling in Noisy Evolutionary Optimization
- Blog: A First Step Towards Runtime Analysis of Evolutionary Neural Architecture Search
- Blog: Bayesian Optimisation for Constrained Problems
- Blog: An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization
- Blog: Tight Regret Bounds for Noisy Optimization of a Brownian Motion
- Blog: Pareto Set Learning for Expensive Multi-Objective Optimization
- Blog: NOWPAC: A provably convergent derivative-free nonlinear optimizer with path-augmented constraints
- Blog: The N-Tuple Bandit Evolutionary Algorithm for Automatic Game Improvement
- Blog: Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory
- Blog: Accelerated Linear Convergence of Stochastic Momentum Methods in Wasserstein Distances
- Blog: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
- Blog: Pseudo-Bayesian Optimization
- Blog: Illustrated tutorial on global optimization in nanophotonics
Showing 60 of 384 papers.
History & citation
Current · Permanent link
- Optimization Without Objective Function Evaluations merged into this direction (64% overlap)
- cost-prioritized initialization split from this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_noisy_objective_functions_5ebb7d5f,
title = {noisy objective functions},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/noisy-objective-functions/rdr_5ebb7d5ff28f43cd8c45f83d530cf570},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_noisy_objective_functions_5ebb7d5f_v2,
title = {noisy objective functions},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/noisy-objective-functions/rdr_5ebb7d5ff28f43cd8c45f83d530cf570/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}