Vladimir V. V'yugin

According to our database1, Vladimir V. V'yugin authored at least 46 papers between 1996 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Adaptive hedging under delayed feedback.
Neurocomputing, 2020

2019
Online aggregation of unbounded losses using shifting experts with confidence.
Mach. Learn., 2019

Integral Mixabilty: a Tool for Efficient Online Aggregation of Functional and Probabilistic Forecasts.
CoRR, 2019

Kolmogorov complexity in the USSR (1975-1982): isolation and its end.
CoRR, 2019

Online Learning with Continuous Ranked Probability Score.
Proceedings of the Conformal and Probabilistic Prediction and Applications, 2019

2018
Aggregating strategies for long-term forecasting.
Proceedings of the 7th Symposium on Conformal and Probabilistic Prediction and Applications, 2018

2017
Long-Term Sequential Prediction Using Expert Advice.
CoRR, 2017

Online Aggregation of Unbounded Signed Losses Using Shifting Experts.
Proceedings of the Conformal and Probabilistic Prediction and Applications, 2017

2016
On Stability of Probability Laws with Respect to Small Violations of Algorithmic Randomness.
Theory Comput. Syst., 2016

Applications of combined financial strategies based on universal adaptive forecasting.
Autom. Remote. Control., 2016

2014
Log-Optimal Portfolio Selection Using the Blackwell Approachability Theorem.
CoRR, 2014

On Stability Property of Probability Laws with Respect to Small Violations of Algorithmic Randomness.
CoRR, 2014

2013
Universal Algorithm for Trading in Stock Market Based on the Method of Calibration.
Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012
On Empirical Meaning of Randomness with Respect to Parametric Families of Probability Distributions.
Theory Comput. Syst., 2012

Asymptotically Optimal Algorithm for Short-Term Trading Based on the Method of Calibration
CoRR, 2012

2011
On universal algorithms for adaptive forecasting.
Probl. Inf. Transm., 2011

Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm.
J. Mach. Learn. Res., 2011

Calibration with Changing Checking Rules and Its Application to Short-Term Trading
CoRR, 2011

On instability of the ergodic limit theorems with respect to small violations of algorithmic randomness.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2009
On calibration error of randomized forecasting algorithms.
Theor. Comput. Sci., 2009

Learning Volatility of Discrete Time Series Using Prediction with Expert Advice.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
A game-theoretic version of Oakes' example for randomized forecasting
CoRR, 2008

Prediction with Expert Advice in Games with Unbounded One-Step Gains
CoRR, 2008

On Sequences with Non-learnable Subsequences.
Proceedings of the Computer Science, 2008

2007
On Empirical Meaning of Randomness with Respect to a Real Parameter.
Proceedings of the Computer Science, 2007

2006
Distribution of investments in the stock market, information types, and algorithmic complexity.
Probl. Inf. Transm., 2006

On impossibility of sequential algorithmic forecasting.
Proceedings of the Kolmogorov Complexity and Applications, 29.01. - 03.02.2006, 2006

2005
Concentration Theorems for Entropy and Free Energy.
Probl. Inf. Transm., 2005

Predictive complexity and information.
J. Comput. Syst. Sci., 2005

2004
Maximum Entropy Principle in Non-ordered Setting.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity.
Probl. Inf. Transm., 2003

Problems of Robustness for Universal Coding Schemes.
Probl. Inf. Transm., 2003

Methods of horizontal gene transfer determination using phylogenetic data.
In Silico Biology, 2003

Transductive Confidence Machine Is Universal.
Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002
Does snooping help?
Theor. Comput. Sci., 2002

On Complexity of Easy Predictable Sequences.
Inf. Comput., 2002

Suboptimal Measures of Predictive Complexity for Absolute Loss Function.
Inf. Comput., 2002

2001
Nonrobustness Property of the Individual Ergodic Theorem.
Probl. Inf. Transm., 2001

Most Sequences Are Stochastic.
Inf. Comput., 2001

Non-linear Inequalities between Predictive and Kolmogorov Complexity
Electronic Colloquium on Computational Complexity (ECCC), 2001

Non-linear Inequalities between Predictive and Kolmogorov Complexities.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

1999
Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences.
Comput. J., 1999

1998
Non-Stochastic Infinite and Finite Sequences.
Theor. Comput. Sci., 1998

Ergodic Theorems for Individual Random Sequences.
Theor. Comput. Sci., 1998

1996
Bayesianism: An Algorithmic Analysis.
Inf. Comput., 1996


  Loading...