conftrace_

hitting time

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

markov chain (3) random walk (3) non-convex optimization (2) stochastic gradient descent (2) laplacian solver (1) electric flow (1) laplace transform (1) monte carlo (1) energy-conserving descent (1) imprecise probabilities (1)

Papers

Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent UAI 2026 The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations ICML 2025 Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path ALT 2023 Hitting times for continuous-time imprecise-Markov chains UAI 2022 A New Approach to Laplacian Solvers and Flow Problems JMLR 2019 Testing Symmetric Markov Chains Without Hitting COLT 2019 A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics COLT 2017 Fast Bidirectional Probability Estimation in Markov Models NeurIPS 2015 From random walks to distances on unweighted graphs NeurIPS 2015 New Insights Into Laplacian Similarity Search CVPR 2015 Hitting and Commute Times in Large Random Neighborhood Graphs JMLR 2014