Alexey Naumov

Orcid: 0000-0002-7536-4576

According to our database1, Alexey Naumov authored at least 22 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
SCAFFLSA: Quantifying and Eliminating Heterogeneity Bias in Federated Linear Stochastic Approximation and Temporal Difference Learning.
CoRR, 2024

2023
Simultaneous approximation of a smooth function and its derivatives by deep neural networks with piecewise-polynomial activations.
Neural Networks, April, 2023

Demonstration-Regularized RL.
CoRR, 2023

Finite-Sample Analysis of the Temporal Difference Learning.
CoRR, 2023

Generative Flow Networks as Entropy-Regularized RL.
CoRR, 2023

Theoretical guarantees for neural control variates in MCMC.
CoRR, 2023

Model-free Posterior Sampling via Learning Rate Randomization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fast Rates for Maximum Entropy Exploration.
Proceedings of the International Conference on Machine Learning, 2023

2022
Finite-time High-probability Bounds for Polyak-Ruppert Averaged Iterates of Linear Stochastic Approximation.
CoRR, 2022

Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Local-Global MCMC kernels: the best of both worlds.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses.
Proceedings of the International Conference on Machine Learning, 2022

2021
Variance Reduction for Dependent Sequences with Applications to Stochastic Gradient MCMC.
SIAM/ASA J. Uncertain. Quantification, 2021

Ex<sup>2</sup>MCMC: Sampling through Exploration Exploitation.
CoRR, 2021

Model-free policy evaluation in Reinforcement Learning via upper solutions.
CoRR, 2021

Tight High Probability Bounds for Linear Stochastic Approximation with Fixed Stepsize.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On the Stability of Random Matrix Product with Markovian Noise: Application to Linear Stochastic Approximation and TD Learning.
Proceedings of the Conference on Learning Theory, 2021

2020
Variance reduction for Markov chains with application to MCMC.
Stat. Comput., 2020

Finite Time Analysis of Linear Two-timescale Stochastic Approximation with Markovian Noise.
Proceedings of the Conference on Learning Theory, 2020

2017
Improving the discoverability, accessibility, and citability of omics datasets: a case report.
J. Am. Medical Informatics Assoc., 2017

A FAIR-Based Approach to Enhancing the Discovery and Re-Use of Transcriptomic Data Assets for Nuclear Receptor Signaling Pathways.
Data Sci. J., 2017


  Loading...