ASOC: An Adaptive Parameter-free Stochastic Optimization Techinique for Continuous Variables
원문 초록
Stochastic optimization is an important task in many optimization problems where the tasks are not expressible as convex optimization problems. In the case of non-convex optimization problems, various different stochastic algorithms like simulated annealing, evolutionary algorithms, and tabu search are available. Most of these algorithms require user-defined parameters specific to the problem in order to find out the optimal solution. Moreover, in many situations, iterative fine-tunings are required for the user-defined parameters, and therefore these algorithms cannot adapt if the search space and the optima changes over time. In this paper we propose an \underline{a}daptive parameter-free \underline{s}tochastic \underline{o}ptimization technique for \underline{c}ontinuous random variables called ASOC.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Semantic Token Communication for Transformer-based Edge Inference
Graph-Supported Dynamic Algorithm Configuration for Multi-Objective Combinatorial Optimization
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
Benchmarking MOEAs for solving continuous multi-objective RL problems
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
JaxSGMC: Modular stochastic gradient MCMC in JAX
토론
이 논문과 연결된 포럼 글이 아직 없습니다.