The following pages link to Vladimir V. V'yugin (Q285511):
Displayed 50 items.
- On stability of probability laws with respect to small violations of algorithmic randomness (Q285512) (← links)
- Item:Q285511 (redirect page) (← links)
- Distribution of investments in the stock market, information types, and algorithmic complexity (Q415678) (← links)
- Applications of combined financial strategies based on universal adaptive forecasting (Q505300) (← links)
- Algebra of invariant properties of binary sequences (Q594090) (← links)
- Item:Q285511 (redirect page) (← links)
- Online aggregation of unbounded losses using shifting experts with confidence (Q669288) (← links)
- On empirical meaning of randomness with respect to parametric families of probability distributions (Q692926) (← links)
- On discrete families of recursively enumerable sets (Q759006) (← links)
- On universal algorithms for adaptive forecasting (Q764391) (← links)
- Some methods for determining the parameters of a mathematical model of health service (Q800244) (← links)
- Variational problems for additive loss functions and Kolmogorov complexity (Q886536) (← links)
- On the stability property of asymptotic laws of ergodic theory and universal compression schemes (Q906093) (← links)
- A sufficient condition for a riskless distribution of investments (Q960713) (← links)
- On calibration error of randomized forecasting algorithms (Q1017657) (← links)
- Nonstochastic estimates (Q1066862) (← links)
- On some examples of upper semilattices of computable enumerations (Q1217117) (← links)
- Segments of recursively enumerable \(m\)-degrees (Q1239316) (← links)
- Ergodic theorems for individual random sequences (Q1275009) (← links)
- Non-stochastic infinite and finite sequences (Q1275010) (← links)
- Nonrobustness property of the individual ergodic theorem (Q1347396) (← links)
- Does snooping help? (Q1605319) (← links)
- Predictive complexity and information (Q1780450) (← links)
- Most sequences are stochastic (Q1854454) (← links)
- Suboptimal measures of predictive complexity for absolute loss function (Q1854535) (← links)
- On complexity of easy predictable sequences (Q1854565) (← links)
- Bayesianism: An algorithmic analysis (Q1923084) (← links)
- Concentration theorems for entropy and free energy (Q2388217) (← links)
- Extremal relations between additive loss functions and the Kolmogorov complexity (Q2388461) (← links)
- Problems of robustness for universal coding schemes (Q2487076) (← links)
- VC Dimension, Fat-Shattering Dimension, Rademacher Averages, and Their Applications (Q2805717) (← links)
- Universal Algorithm for Trading in Stock Market Based on the Method of Calibration (Q2859206) (← links)
- (Q3046697) (← links)
- (Q3473870) (← links)
- On Empirical Meaning of Randomness with Respect to a Real Parameter (Q3499788) (← links)
- On Sequences with Non-learnable Subsequences (Q3503648) (← links)
- (Q3505486) (← links)
- On Calibration Error of Randomized Forecasting Algorithms (Q3520074) (← links)
- Learning Volatility of Discrete Time Series Using Prediction with Expert Advice (Q3646115) (← links)
- The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses (Q3648741) (← links)
- (Q3662341) (← links)
- (Q3679101) (← links)
- (Q3779738) (← links)
- On the Defect of Randomness of a Finite Object with Respect to Measures with Given Complexity Bounds (Q3785944) (← links)
- Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей (Q3842376) (← links)
- О длине максимальной серии “успехов” в индивидуальной случайной последовательности (Q3842415) (← links)
- (Q4052098) (← links)
- (Q4060955) (← links)
- (Q4198620) (← links)
- (Q4272798) (← links)