![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Vladimir V. V'yugin
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Vladimir V. V'yugin, Vladimir G. Trunov, Rasim D. Zukhba:
Prediction of Locally Stationary Data Using Expert Advice. Probl. Inf. Transm. 60(1): 35-52 (2024) - 2023
- [c16]Vladimir G. Trunov, Vladimir V. V'yugin:
Online aggregation of conformal predictive systems. COPA 2023: 430-449 - [i25]Vladimir V'yugin, Vladimir G. Trunov:
Prediction of Locally Stationary Data Using Expert Advice. CoRR abs/2310.19591 (2023) - 2022
- [j25]Vladimir V'yugin, Vladimir G. Trunov:
Online aggregation of probability forecasts with confidence. Pattern Recognit. 121: 108193 (2022) - [i24]Vladimir V. V'yugin:
Ergodic theorems for algorithmically random points. CoRR abs/2202.13465 (2022) - 2021
- [j24]Alexander Korotin, Vladimir V'yugin, Evgeny Burnaev
:
Mixability of integral losses: A key to efficient online aggregation of functional and probabilistic forecasts. Pattern Recognit. 120: 108175 (2021) - [i23]Vladimir V. V'yugin:
Degrees of randomized computability: decomposition into atoms. CoRR abs/2109.04410 (2021) - [i22]Vladimir V'yugin, Vladimir G. Trunov:
Online Aggregation of Probability Forecasts with Confidence. CoRR abs/2109.14309 (2021) - 2020
- [j23]Alexander Korotin
, Vladimir V'yugin, Evgeny Burnaev
:
Adaptive hedging under delayed feedback. Neurocomputing 397: 356-368 (2020) - [c15]Alexander Korotin, Vladimir V'yugin, Evgeny Burnaev:
Mixing past predictions. COPA 2020: 171-188
2010 – 2019
- 2019
- [j22]Vladimir V'yugin
, Vladimir G. Trunov:
Online aggregation of unbounded losses using shifting experts with confidence. Mach. Learn. 108(3): 425-444 (2019) - [c14]Vladimir V. V'yugin, Vladimir G. Trunov:
Online Learning with Continuous Ranked Probability Score. COPA 2019: 163-177 - [i21]Vladimir V'yugin, Vladimir G. Trunov:
Online Learning with Continuous Ranked Probability Score. CoRR abs/1902.10173 (2019) - [i20]Alexander Korotin, Vladimir V'yugin, Evgeny Burnaev:
Adaptive Hedging under Delayed Feedback. CoRR abs/1902.10433 (2019) - [i19]Vladimir V. V'yugin:
Kolmogorov complexity in the USSR (1975-1982): isolation and its end. CoRR abs/1907.05056 (2019) - [i18]Alexander Korotin, Vladimir V'yugin, Evgeny Burnaev:
Integral Mixabilty: a Tool for Efficient Online Aggregation of Functional and Probabilistic Forecasts. CoRR abs/1912.07048 (2019) - 2018
- [c13]Alexander Korotin, Vladimir V'yugin, Evgeny Burnaev:
Aggregating strategies for long-term forecasting. COPA 2018: 63-82 - [i17]Alexander Korotin, Vladimir V'yugin, Evgeny Burnaev:
Aggregating Strategies for Long-term Forecasting. CoRR abs/1803.06727 (2018) - [i16]Vladimir V. V'yugin, Vladimir G. Trunov:
Online Aggregation of Unbounded Losses Using Shifting Experts with Confidence. CoRR abs/1808.00741 (2018) - 2017
- [c12]Vladimir V. V'yugin:
Online Aggregation of Unbounded Signed Losses Using Shifting Experts. COPA 2017: 3-17 - [i15]Eugeny Burnaev, Alexander Korotin, Vladimir V'yugin:
Long-Term Sequential Prediction Using Expert Advice. CoRR abs/1711.03194 (2017) - 2016
- [j21]Vladimir V. V'yugin, Vladimir G. Trunov:
Applications of combined financial strategies based on universal adaptive forecasting. Autom. Remote. Control. 77(8): 1428-1446 (2016) - [j20]Vladimir V. V'yugin:
On Stability of Probability Laws with Respect to Small Violations of Algorithmic Randomness. Theory Comput. Syst. 58(3): 403-423 (2016) - 2014
- [i14]Vladimir V. V'yugin:
On Stability Property of Probability Laws with Respect to Small Violations of Algorithmic Randomness. CoRR abs/1409.3865 (2014) - [i13]Vladimir V'yugin:
Log-Optimal Portfolio Selection Using the Blackwell Approachability Theorem. CoRR abs/1410.5996 (2014) - 2013
- [c11]Vladimir V. V'yugin:
Universal Algorithm for Trading in Stock Market Based on the Method of Calibration. ALT 2013: 53-67 - 2012
- [j19]Vladimir V. V'yugin:
On Empirical Meaning of Randomness with Respect to Parametric Families of Probability Distributions. Theory Comput. Syst. 50(2): 296-312 (2012) - [i12]Vladimir V. V'yugin, Vladimir G. Trunov:
Asymptotically Optimal Algorithm for Short-Term Trading Based on the Method of Calibration. CoRR abs/1205.3767 (2012) - 2011
- [j18]Vladimir V. V'yugin:
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm. J. Mach. Learn. Res. 12: 241-266 (2011) - [j17]Vladimir V. V'yugin:
On universal algorithms for adaptive forecasting. Probl. Inf. Transm. 47(2): 166-189 (2011) - [c10]Vladimir V. V'yugin:
On instability of the ergodic limit theorems with respect to small violations of algorithmic randomness. ISIT 2011: 1514-1518 - [i11]Vladimir G. Trunov, Vladimir V. V'yugin:
Calibration with Changing Checking Rules and Its Application to Short-Term Trading. CoRR abs/1105.4272 (2011) - [i10]Vladimir V. V'yugin:
On Instability of the Ergodic Limit Theorems with Respect to Small Violations of Algorithmic Randomness. CoRR abs/1105.4274 (2011) - 2010
- [i9]Vladimir V. V'yugin:
Online Learning in Case of Unbounded Losses Using the Follow Perturbed Leader Algorithm. CoRR abs/1008.4232 (2010)
2000 – 2009
- 2009
- [j16]Vladimir V. V'yugin:
On calibration error of randomized forecasting algorithms. Theor. Comput. Sci. 410(19): 1781-1795 (2009) - [c9]Vladimir V. V'yugin:
The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses. ALT 2009: 38-52 - [c8]Vladimir V. V'yugin:
Learning Volatility of Discrete Time Series Using Prediction with Expert Advice. SAGA 2009: 16-30 - 2008
- [c7]Vladimir V. V'yugin:
On Sequences with Non-learnable Subsequences. CSR 2008: 302-313 - [i8]Vladimir V. V'yugin:
On Sequences with Non-Learnable Subsequences. CoRR abs/0806.4341 (2008) - [i7]Vladimir V. V'yugin:
Prediction with Expert Advice in Games with Unbounded One-Step Gains. CoRR abs/0806.4391 (2008) - [i6]Vladimir V. V'yugin:
On empirical meaning of randomness with respect to a real parameter. CoRR abs/0806.4484 (2008) - [i5]Vladimir V. V'yugin:
Problems of robustness for universal coding schemes. CoRR abs/0806.4572 (2008) - [i4]Vladimir V. V'yugin:
A game-theoretic version of Oakes' example for randomized forecasting. CoRR abs/0808.3746 (2008) - 2007
- [c6]Vladimir V. V'yugin:
On Calibration Error of Randomized Forecasting Algorithms. ALT 2007: 388-402 - [c5]Vladimir V. V'yugin:
On Empirical Meaning of Randomness with Respect to a Real Parameter. CSR 2007: 387-396 - 2006
- [j15]Vladimir V. V'yugin, Victor P. Maslov
:
Distribution of investments in the stock market, information types, and algorithmic complexity. Probl. Inf. Transm. 42(3): 251-261 (2006) - [i3]Vladimir V. V'yugin:
On impossibility of sequential algorithmic forecasting. Kolmogorov Complexity and Applications 2006 - 2005
- [j14]Michael V. Vyugin, Vladimir V. V'yugin:
Predictive complexity and information. J. Comput. Syst. Sci. 70(4): 539-554 (2005) - [j13]Vladimir V. V'yugin, Victor P. Maslov
:
Concentration Theorems for Entropy and Free Energy. Probl. Inf. Transm. 41(2): 134-149 (2005) - 2004
- [c4]Victor P. Maslov, Vladimir V. V'yugin:
Maximum Entropy Principle in Non-ordered Setting. ALT 2004: 221-233 - 2003
- [j12]Vassily A. Lyubetsky, Vladimir V. V'yugin:
Methods of horizontal gene transfer determination using phylogenetic data. Silico Biol. 3(1-2): 17-31 (2003) - [j11]Vladimir V. V'yugin:
Problems of Robustness for Universal Coding Schemes. Probl. Inf. Transm. 39(1): 32-46 (2003) - [j10]Vladimir V. V'yugin, Victor P. Maslov:
Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity. Probl. Inf. Transm. 39(4): 380-394 (2003) - [c3]Ilia Nouretdinov, Vladimir V. V'yugin, Alex Gammerman:
Transductive Confidence Machine Is Universal. ALT 2003: 283-297 - 2002
- [j9]Vladimir V. V'yugin:
Suboptimal Measures of Predictive Complexity for Absolute Loss Function. Inf. Comput. 175(2): 146-157 (2002) - [j8]Michael V. Vyugin, Vladimir V. V'yugin:
On Complexity of Easy Predictable Sequences. Inf. Comput. 178(1): 241-252 (2002) - [j7]Vladimir V. V'yugin:
Does snooping help? Theor. Comput. Sci. 276(1-2): 407-415 (2002) - [c2]Michael V. Vyugin, Vladimir V. V'yugin:
Predictive Complexity and Information. COLT 2002: 90-104 - 2001
- [j6]Vladimir V. V'yugin:
Most Sequences Are Stochastic. Inf. Comput. 169(2): 252-263 (2001) - [j5]Vladimir V. V'yugin:
Nonrobustness Property of the Individual Ergodic Theorem. Probl. Inf. Transm. 37(2): 108-119 (2001) - [c1]Michael V. Vyugin, Vladimir V. V'yugin:
Non-linear Inequalities between Predictive and Kolmogorov Complexities. ALT 2001: 190-204 - [i2]Michael V. Vyugin, Vladimir V. V'yugin:
Predictive complexity and information. Electron. Colloquium Comput. Complex. TR01 (2001) - [i1]Michael V. Vyugin, Vladimir V. V'yugin:
Non-linear Inequalities between Predictive and Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR01 (2001)
1990 – 1999
- 1999
- [j4]Vladimir V. V'yugin:
Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences. Comput. J. 42(4): 294-317 (1999) - 1998
- [j3]Vladimir V. V'yugin:
Ergodic Theorems for Individual Random Sequences. Theor. Comput. Sci. 207(2): 343-361 (1998) - [j2]Vladimir V. V'yugin:
Non-Stochastic Infinite and Finite Sequences. Theor. Comput. Sci. 207(2): 363-382 (1998) - 1996
- [j1]Vladimir V. V'yugin:
Bayesianism: An Algorithmic Analysis. Inf. Comput. 127(1): 1-10 (1996)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-13 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint