Alexey V. Chernov

Orcid: 0000-0002-5527-803X

Affiliations:
  • University of Brighton, UK
  • University of Bedfordshire, UK (2012 - 2014)
  • Durham University, UK (2011 - 2012)
  • University of London, Royal Holloway, UK (2007 - 2011)
  • LIF, Marseilles, France (former)
  • IDSIA, Lugano, Switzerland (former)
  • Moscow State University, Department of Mathematical Logic and Theory of Algorithms, Moscow, Russia (PhD 2003)


According to our database1, Alexey V. Chernov authored at least 15 papers between 2002 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
A Closer Look at Adaptive Regret.
J. Mach. Learn. Res., 2016

2015
Specialist Experts for Prediction with Side Information.
Proceedings of the IEEE International Conference on Data Mining Workshop, 2015

2010
Supermartingales in prediction with expert advice.
Theor. Comput. Sci., 2010

Aggregating Algorithm competing with Banach lattices
CoRR, 2010

Prediction with Advice of Unknown Number of Experts.
Proceedings of the UAI 2010, 2010

Prediction with Expert Advice under Discounted Loss.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
Prediction with Expert Evaluators' Advice.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Algorithmic randomness and splitting of supermartingales
CoRR, 2008

On-Line Probability, Complexity and Randomness.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007
Algorithmic complexity bounds on future prediction errors.
Inf. Comput., 2007

2006
Complexity Monotone in Conditions and Future Prediction Errors.
Proceedings of the Kolmogorov Complexity and Applications, 29.01. - 03.02.2006, 2006

Prefix-Like Complexities and Computability in the Limit.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Monotone Conditional Complexity Bounds on Future Prediction Errors.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2002
Upper semi-lattice of binary strings with the relation "x is simple conditional to y".
Theor. Comput. Sci., 2002

Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002


  Loading...