Concentration of first hitting times under additive drift
From MaRDI portal
Publication:306489
DOI10.1007/S00453-015-0048-0zbMATH Open1348.68229OpenAlexW4379365767MaRDI QIDQ306489FDOQ306489
Authors: Timo Kötzing 
Publication date: 31 August 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0048-0
Recommendations
- scientific article; zbMATH DE number 37986
- scientific article; zbMATH DE number 4070099
- scientific article; zbMATH DE number 1500601
- First hitting time of integral diffusions and applications
- On the first hitting time density for a reducible diffusion process
- Recurrent first hitting times in Wiener diffusion under several observation schemes
- Tails of the first hitting times of linear diffusions
- The probability distributions of the first hitting times of radial Ornstein-Uhlenbeck processes
- On the first hitting time of a one-dimensional diffusion and a compound Poisson process
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Cites Work
- Weighted sums of certain dependent random variables
- Title not available (Why is that?)
- Concentration of Measure for the Analysis of Randomized Algorithms
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Adaptive drift analysis
- Multiplicative drift analysis
- On the runtime analysis of the simple genetic algorithm
- Exponential inequalities for martingales with applications
- Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
- Concentration of first hitting times under additive drift
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- Hoeffding's inequality for supermartingales
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sub-Gaussian random variables
- Simplified drift analysis for proving lower bounds in evolutionary computation
Cited In (18)
- Title not available (Why is that?)
- OneMax is not the easiest function for fitness improvements
- Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints
- Drift Analysis and Evolutionary Algorithms Revisited
- Concentration of first hitting times under additive drift
- The complex parameter landscape of the compact genetic algorithm
- Does comma selection help to cope with local optima?
- Fixed-target runtime analysis
- Two-dimensional drift analysis: optimizing two functions simultaneously can be hard
- Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions
- Multiplicative up-drift
- First-hitting times under drift
- Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
- The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
- Runtime Analysis of a Co-Evolutionary Algorithm
This page was built for publication: Concentration of first hitting times under additive drift
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306489)
