Publications associées à Méthode hill-climbing

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Function

Patrick Thiran, Negar Kiyavash, Saber Salehkaleybar

We study the performance of Stochastic Cubic Regularized Newton (SCRN) on a class of functions satisfying gradient dominance property with

1\le\alpha\le2

which holds in a wide range of applications in machine learning and signal processing. This conditio ...

NeurIPS2022

Méthode hill-climbing

Graph Chatbot

Chattez avec Graph Search

Novel Ordering-based Approaches for Causal Structure Learning in the Presence of Unobserved Variables

Enriching the Computational Toolbox for Organocatalysis

Dual-function engineering to construct ultra-stable anodes for potassium-ion hybrid capacitors: N, O-doped porous carbon spheres

Micro-addition of Fe in highly alloyed Cu-Ti alloys to improve both formability and strength

Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Function

Memory of Motion for Initializing Optimization in Robotics

Optimization of multi-group energy structures for diffusion analyses of sodium-cooled fast reactors assisted by simulated annealing - Part I: Methodology demonstration

Active Improvement of Control Policies with Bayesian Gaussian Mixture Model

Ridesourcing Systems - Simulated Annealing Algorithm for Solving the Matching and Dispatching Problem in Dynamic Large-Scale Settings

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Novel Ordering-based Approaches for Causal Structure Learning in the Presence of Unobserved Variables

Enriching the Computational Toolbox for Organocatalysis

Memory of Motion for Initializing Optimization in Robotics

Ridesourcing Systems - Simulated Annealing Algorithm for Solving the Matching and Dispatching Problem in Dynamic Large-Scale Settings

Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Function

Optimization of multi-group energy structures for diffusion analyses of sodium-cooled fast reactors assisted by simulated annealing - Part I: Methodology demonstration

Dual-function engineering to construct ultra-stable anodes for potassium-ion hybrid capacitors: N, O-doped porous carbon spheres

Active Improvement of Control Policies with Bayesian Gaussian Mixture Model

Micro-addition of Fe in highly alloyed Cu-Ti alloys to improve both formability and strength

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization