Daniil Tiapkin

Orcid: 0000-0002-8832-7926

According to our database1, Daniil Tiapkin authored at least 13 papers between 2020 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
Incentivized Learning in Principal-Agent Bandit Games.
CoRR, 2024

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

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

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

Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Stochastic saddle-point optimization for the Wasserstein barycenter problem.
Optim. Lett., 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

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

Primal-Dual Stochastic Mirror Descent for MDPs.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Improved Complexity Bounds in Wasserstein Barycenter Problem.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Stochastic Saddle-Point Optimization for Wasserstein Barycenters.
CoRR, 2020


  Loading...