default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri Kalnishkan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j11]Yuri Kalnishkan:
Prediction with expert advice for a finite number of experts: A practical introduction. Pattern Recognit. 126: 108557 (2022)- 2020
- [j10]Raisa Dzhamtyrova, Yuri Kalnishkan
:
Universal algorithms for multinomial logistic regression under Kullback-Leibler game. Neurocomputing 397: 369-380 (2020) - 2019
- [j9]Dmitry Adamskiy, Anthony Bellotti, Raisa Dzhamtyrova, Yuri Kalnishkan:
Aggregating Algorithm for prediction of packs. Mach. Learn. 108(8-9): 1231-1260 (2019) - 2014
- [j8]Yuri Kalnishkan, Michael V. Vyugin, Vladimir Vovk:
Generalised entropies and asymptotic complexities of languages. Inf. Comput. 237: 101-141 (2014) - 2013
- [j7]Fedor Zhdanov, Yuri Kalnishkan:
An identity for kernel ridge regression. Theor. Comput. Sci. 473: 157-178 (2013) - 2012
- [j6]Fedor Zhdanov, Yuri Kalnishkan:
Universal Algorithms for Probability Forecasting. Int. J. Artif. Intell. Tools 21(4) (2012) - 2010
- [j5]Alexey V. Chernov, Yuri Kalnishkan, Fedor Zhdanov, Vladimir Vovk:
Supermartingales in prediction with expert advice. Theor. Comput. Sci. 411(29-30): 2647-2669 (2010) - 2008
- [j4]Yuri Kalnishkan, Michael V. Vyugin:
The weak aggregating algorithm and weak mixability. J. Comput. Syst. Sci. 74(8): 1228-1244 (2008) - 2005
- [j3]Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
How many strings are easy to predict? Inf. Comput. 201(1): 55-71 (2005) - 2004
- [j2]Yuri Kalnishkan, Volodya Vovk, Michael V. Vyugin:
Loss functions, complexities, and the Legendre transformation. Theor. Comput. Sci. 313(2): 195-207 (2004) - 2002
- [j1]Yuri Kalnishkan:
General linear relations between different types of predictive complexity. Theor. Comput. Sci. 271(1-2): 181-200 (2002)
Conference and Workshop Papers
- 2022
- [c30]Najim Al-Baghdadi, Yuri Kalnishkan, David Lindsay, Siân Lindsay:
Online Portfolio Hedging with the Weak Aggregating Algorithm. COPA 2022: 149-168 - [c29]Wojciech Wisniewski, Yuri Kalnishkan, David Lindsay, Siân Lindsay:
Equilibrium Resolution for Epoch Partitioning. AIAI (2) 2022: 387-401 - 2021
- [c28]Raisa Dzhamtyrova, Yuri Kalnishkan:
A lower bound for a prediction algorithm under the Kullback-Leibler game. COPA 2021: 39-51 - 2020
- [c27]Najim Al-Baghdadi, David Lindsay, Yuri Kalnishkan, Siân Lindsay:
Practical investment with the long-short game. COPA 2020: 209-228 - [c26]Raisa Dzhamtyrova, Yuri Kalnishkan:
Prediction with Expert Advice for Value at Risk. IJCNN 2020: 1-8 - [c25]Raisa Dzhamtyrova, Yuri Kalnishkan:
Competitive Online Quantile Regression. IPMU (1) 2020: 499-512 - 2019
- [c24]Najim Al-Baghdadi, Wojciech Wisniewski, David Lindsay, Siân Lindsay, Yuri Kalnishkan, Chris Watkins:
Structuring Time Series Data to Gain Insight into Agent Behaviour. IEEE BigData 2019: 5480-5490 - [c23]Raisa Dzhamtyrova, Yuri Kalnishkan:
Competitive Online Regression under Continuous Ranked Probability Score. COPA 2019: 178-195 - [c22]Raisa Dzhamtyrova, Yuri Kalnishkan:
Competitive Online Generalised Linear Regression with Multidimensional Outputs. IJCNN 2019: 1-8 - 2018
- [c21]Mario Bijelic, Christian Muench, Werner Ritter, Yuri Kalnishkan, Klaus Dietmayer:
Robustness Against Unknown Noise for Raw Data Fusing Neural Networks. ITSC 2018: 2177-2184 - 2016
- [c20]Yuri Kalnishkan:
An Upper Bound for Aggregating Algorithm for Regression with Changing Dependencies. ALT 2016: 238-252 - 2015
- [c19]Yuri Kalnishkan, Dmitry Adamskiy, Alexey V. Chernov, Tim Scarfe:
Specialist Experts for Prediction with Side Information. ICDM Workshops 2015: 1470-1477 - 2013
- [c18]Tim Scarfe, Wouter M. Koolen, Yuri Kalnishkan:
A Long-Range Self-similarity Approach to Segmenting DJ Mixed Music Streams. AIAI 2013: 235-244 - 2010
- [c17]Fedor Zhdanov, Yuri Kalnishkan:
An Identity for Kernel Ridge Regression. ALT 2010: 405-419 - [c16]Fedor Zhdanov, Yuri Kalnishkan:
Linear Probability Forecasting. AIAI 2010: 4-11 - 2008
- [c15]Alexey V. Chernov, Yuri Kalnishkan, Fedor Zhdanov, Vladimir Vovk:
Supermartingales in Prediction with Expert Advice. ALT 2008: 199-213 - 2007
- [c14]Steven Busuttil, Yuri Kalnishkan, Alex Gammerman:
Improving the aggregating algorithm for regression. Artificial Intelligence and Applications 2007: 379-384 - [c13]Steven Busuttil, Yuri Kalnishkan:
Online Regression Competitive with Changing Predictors. ALT 2007: 181-195 - [c12]Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
Generalised Entropy and Asymptotic Complexities of Languages. COLT 2007: 293-307 - [c11]Steven Busuttil, Yuri Kalnishkan:
Weighted Kernel Regression for Predicting Changing Dependencies. ECML 2007: 535-542 - 2005
- [c10]Yuri Kalnishkan, Michael V. Vyugin:
The Weak Aggregating Algorithm and Weak Mixability. COLT 2005: 188-203 - 2004
- [c9]Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
A Criterion for the Existence of Predictive Complexity for Binary Games. ALT 2004: 249-263 - [c8]Alex Gammerman, Yuri Kalnishkan, Vladimir Vovk:
On-line Prediction with Kernels and the Complexity Approximation Principle. UAI 2004: 170-176 - 2003
- [c7]Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
How Many Strings Are Easy to Predict? COLT 2003: 522-536 - 2002
- [c6]Yuri Kalnishkan, Michael V. Vyugin:
On the Absence of Predictive Complexity for Some Games. ALT 2002: 164-172 - [c5]Yuri Kalnishkan, Michael V. Vyugin:
Mixability and the Existence of Weak Complexities. COLT 2002: 105-120 - 2001
- [c4]Yuri Kalnishkan, Michael V. Vyugin, Volodya Vovk:
Loss Functions, Complexities, and the Legendre Transformation. ALT 2001: 181-189 - 2000
- [c3]Yuri Kalnishkan:
Complexity Approximation Principle and Rissanen's Approach to Real-Valued Parameters. ECML 2000: 203-210 - 1999
- [c2]Yuri Kalnishkan:
Genral Linear Relations among Different Types of Predictive Complexity. ALT 1999: 323-334 - [c1]Yuri Kalnishkan:
Linear Relations between Square-Loss and Kolmogorov Complexity. COLT 1999: 226-232
Informal and Other Publications
- 2024
- [i7]Wojciech Wisniewski, Yuri Kalnishkan, David Lindsay, Siân Lindsay:
Temporal distribution of clusters of investors and their application in prediction with expert advice. CoRR abs/2406.19403 (2024) - 2017
- [i6]Dmitry Adamskiy, Tony Bellotti, Raisa Dzhamtyrova, Yuri Kalnishkan:
Aggregating Algorithm for Prediction of Packs. CoRR abs/1710.08114 (2017) - 2012
- [i5]Alex Gammerman, Yuri Kalnishkan, Vladimir Vovk:
On-line Prediction with Kernels and the Complexity Approximation Principle. CoRR abs/1207.4113 (2012) - 2011
- [i4]Fedor Zhdanov, Yuri Kalnishkan:
An Identity for Kernel Ridge Regression. CoRR abs/1112.1390 (2011) - 2010
- [i3]Fedor Zhdanov, Yuri Kalnishkan:
Linear Probability Forecasting. CoRR abs/1001.0879 (2010) - [i2]Fedor Zhdanov, Alexey V. Chernov, Yuri Kalnishkan:
Aggregating Algorithm competing with Banach lattices. CoRR abs/1002.0709 (2010) - [i1]Alexey V. Chernov, Yuri Kalnishkan, Fedor Zhdanov, Vladimir Vovk:
Supermartingales in Prediction with Expert Advice. CoRR abs/1003.2218 (2010)
Coauthor Index
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-07-25 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
