Copertina

Self-Repellent Random Walks on General Graphs -- Achieving Minimal Sampling Variance via Nonlinear Markov Chains

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Doshi, Vishwaraj, Hu, Jie, Eun, Do Young
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Probability Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks
di: Hu, Jie, et al.
Pubblicazione: (2024)

Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications
di: Hu, Jie, et al.
Pubblicazione: (2024)

Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs
di: Hu, Jie, et al.
Pubblicazione: (2025)

Markov Chain Variance Estimation: A Stochastic Approximation Approach
di: Agrawal, Shubhada, et al.
Pubblicazione: (2024)

Repelling Random Walks
di: Reid, Isaac, et al.
Pubblicazione: (2023)

Near-Optimal Clustering in Mixture of Markov Chains
di: Lee, Junghyun, et al.
Pubblicazione: (2025)

Neural Continuous-Time Markov Chain: Discrete Diffusion via Decoupled Jump Timing and Direction
di: Li, Jingyuan, et al.
Pubblicazione: (2026)

An Analysis of Elo Rating Systems via Markov Chains
di: Olesker-Taylor, Sam, et al.
Pubblicazione: (2024)

Deep Learning for Computing Convergence Rates of Markov Chains
di: Qu, Yanlin, et al.
Pubblicazione: (2024)

On Anti-Confinement Estimates for Self-Repelling Random Walks
di: Schmidt, Tobias, et al.
Pubblicazione: (2026)

On Statistical Estimation of Edge-Reinforced Random Walks
di: Qinghua, et al.
Pubblicazione: (2025)

Deep Learning for Markov Chains: Lyapunov Functions, Poisson's Equation, and Stationary Distributions
di: Qu, Yanlin, et al.
Pubblicazione: (2025)

The Partition Principle Revisited: Non-Equal Volume Designs Achieve Minimal Expected Star Discrepancy
di: Xu, Xiaoda
Pubblicazione: (2026)

Complexity of Markov Chain Monte Carlo for Generalized Linear Models
di: Chak, Martin, et al.
Pubblicazione: (2025)

Score-Repellent Monte Carlo: Toward Efficient Non-Markovian Sampler with Constant Memory in General State Spaces
di: Hu, Jie, et al.
Pubblicazione: (2026)

Some aspects of robustness in modern Markov Chain Monte Carlo
di: Power, Sam, et al.
Pubblicazione: (2025)

Wasserstein-p Central Limit Theorem Rates: From Local Dependence to Markov Chains
di: Zhang, Yixuan, et al.
Pubblicazione: (2026)

Keeping Up With the Winner! Targeted Advertisement to Communities in Social Networks
di: Mallick, Shailaja, et al.
Pubblicazione: (2024)

Reconstructing the Geometry of Random Geometric Graphs
di: Huang, Han, et al.
Pubblicazione: (2024)

Accelerating Multilevel Markov Chain Monte Carlo Using Machine Learning Models
di: Reddy, Sohail, et al.
Pubblicazione: (2024)

Limit Theorems for Stochastic Gradient Descent with Infinite Variance
di: Blanchet, Jose, et al.
Pubblicazione: (2024)

Weighted Random Dot Product Graphs
di: Marenco, Bernardo, et al.
Pubblicazione: (2025)

A Study in Markov Chains, Loop-Erased Random Walk and Loop Soups
di: Gu, Zhuohan
Pubblicazione: (2024)

Random-Bridges as Stochastic Transports for Generative Models
di: Goria, Stefano, et al.
Pubblicazione: (2025)

Efficient Training of Deep Neural Operator Networks via Randomized Sampling
di: Karumuri, Sharmila, et al.
Pubblicazione: (2024)

Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors
di: Labarthe, Aldric
Pubblicazione: (2026)

Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting
di: Ustimenko, Aleksei, et al.
Pubblicazione: (2023)

Randomized Midpoint Method for Log-Concave Sampling under Constraints
di: Yu, Yifeng, et al.
Pubblicazione: (2024)

Sample Path Large Deviations for Random Walks on Regular Trees
di: Jiang, Jie, et al.
Pubblicazione: (2025)

Flow Matching: Markov Kernels, Stochastic Processes and Transport Plans
di: Wald, Christian, et al.
Pubblicazione: (2025)

Information Geometry of Absorbing Markov-Chain and Discriminative Random Walks
di: Kimura, Masanari
Pubblicazione: (2026)

Rates of Convergence in the Central Limit Theorem for Markov Chains, with an Application to TD Learning
di: Srikant, R.
Pubblicazione: (2024)

Homogenization of Multi-agent Learning Dynamics in Finite-state Markov Games
di: Kerzreho, Yann
Pubblicazione: (2025)

Sampling non-log-concave densities via Hessian-free high-resolution dynamics
di: Wang, Xiaoyu, et al.
Pubblicazione: (2026)

Existence of Adversarial Examples for Random Convolutional Networks via Isoperimetric Inequalities on $\mathbb{so}(d)$
di: Daniely, Amit
Pubblicazione: (2025)

Posterior Sampling with Denoising Oracles via Tilted Transport
di: Bruna, Joan, et al.
Pubblicazione: (2024)

Resolving Node Identifiability in Graph Neural Processes via Laplacian Spectral Encodings
di: Yan, Zimo, et al.
Pubblicazione: (2025)

Sharp Concentration Inequalities: Phase Transition and Mixing of Orlicz Tails with Variance
di: Shen, Yinan, et al.
Pubblicazione: (2026)

Dissimilar Batch Decompositions of Random Datasets
di: Ganesan, Ghurumuruhan
Pubblicazione: (2025)

Adaptive Learning via Off-Model Training and Importance Sampling for Fully Non-Markovian Optimal Stochastic Control. Complete version
di: Leão, Dorival, et al.
Pubblicazione: (2026)