![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Vitaly Kuznetsov
Person information
Refine list
![note](https://dblp.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
- 2020
- [j3]Vitaly Kuznetsov, Mehryar Mohri:
Discrepancy-Based Theory and Algorithms for Forecasting Non-Stationary Time Series. Ann. Math. Artif. Intell. 88(4): 367-399 (2020)
2010 – 2019
- 2019
- [c16]Zelda Mariet, Vitaly Kuznetsov:
Foundations of Sequence-to-Sequence Modeling for Time Series. AISTATS 2019: 408-417 - [c15]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Holakou Rahmanian, Manfred K. Warmuth:
Online Non-Additive Path Learning under Full and Partial Information. ALT 2019: 274-299 - [i8]Charles Weill, Javier Gonzalvo, Vitaly Kuznetsov, Scott Yang, Scott Yak, Hanna Mazzawi, Eugen Hotaj, Ghassen Jerfel, Vladimir Macko, Ben Adlam, Mehryar Mohri, Corinna Cortes:
AdaNet: A Scalable and Flexible Framework for Automatically Learning Ensembles. CoRR abs/1905.00080 (2019) - 2018
- [c14]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Dmitry Storcheus, Scott Yang:
Efficient Gradient Computation for Structured Output Learning with Rational and Tropical Losses. NeurIPS 2018: 6811-6822 - [i7]Vitaly Kuznetsov, Mehryar Mohri:
Theory and Algorithms for Forecasting Time Series. CoRR abs/1803.05814 (2018) - [i6]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Holakou Rahmanian, Manfred K. Warmuth:
Online Non-Additive Path Learning under Full and Partial Information. CoRR abs/1804.06518 (2018) - [i5]Vitaly Kuznetsov, Zelda Mariet:
Foundations of Sequence-to-Sequence Modeling for Time Series. CoRR abs/1805.03714 (2018) - 2017
- [j2]Vitaly Kuznetsov, Mehryar Mohri:
Generalization bounds for non-stationary mixing processes. Mach. Learn. 106(1): 93-117 (2017) - [c13]Corinna Cortes, Xavier Gonzalvo, Vitaly Kuznetsov, Mehryar Mohri, Scott Yang:
AdaNet: Adaptive Structural Learning of Artificial Neural Networks. ICML 2017: 874-883 - [c12]Vitaly Kuznetsov, Mehryar Mohri:
Discriminative State Space Models. NIPS 2017: 5671-5679 - [e1]Oren Anava, Azadeh Khaleghi, Marco Cuturi, Vitaly Kuznetsov, Alexander Rakhlin:
Proceedings of the NIPS 2016 Time Series Workshop, co-located with the 30th Annual Conference on Neural Information Processing Systems (NIPS 2016), Barcelona, Spain, December 9, 2016. JMLR Workshop and Conference Proceedings 55, JMLR.org 2017 [contents] - 2016
- [c11]Vitaly Kuznetsov, Mehryar Mohri:
Time series prediction and online learning. COLT 2016: 1190-1213 - [c10]Vitaly Kuznetsov, Hank Liao, Mehryar Mohri, Michael Riley, Brian Roark:
Learning N-Gram Language Models from Uncertain Data. INTERSPEECH 2016: 2323-2327 - [c9]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Scott Yang:
Structured Prediction Theory Based on Factor Graph Complexity. NIPS 2016: 2514-2522 - [i4]Corinna Cortes, Mehryar Mohri, Vitaly Kuznetsov, Scott Yang:
Structured Prediction Theory and Voted Risk Minimization. CoRR abs/1605.06443 (2016) - [i3]Corinna Cortes, Xavi Gonzalvo, Vitaly Kuznetsov, Mehryar Mohri, Scott Yang:
AdaNet: Adaptive Structural Learning of Artificial Neural Networks. CoRR abs/1607.01097 (2016) - 2015
- [c8]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Manfred K. Warmuth:
On-Line Learning Algorithms for Path Experts with Non-Additive Losses. COLT 2015: 424-447 - [c7]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Umar Syed:
Structural Maxent Models. ICML 2015: 391-399 - [c6]Corinna Cortes, Prasoon Goyal, Vitaly Kuznetsov, Mehryar Mohri:
Kernel Extraction via Voted Risk Minimization. FE@NIPS 2015: 72-89 - [c5]Vitaly Kuznetsov, Mehryar Mohri:
Learning Theory and Algorithms for Forecasting Non-stationary Time Series. NIPS 2015: 541-549 - [i2]Corinna Cortes, Prasoon Goyal, Vitaly Kuznetsov, Mehryar Mohri:
Voted Kernel Regularization. CoRR abs/1509.04340 (2015) - 2014
- [j1]Abraham Isgur, Vitaly Kuznetsov, Mustazee Rahman
, Stephen M. Tanny:
Nested Recursions, Simultaneous Parameters and Tree Superpositions. Electron. J. Comb. 21(1): 1 (2014) - [c4]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri:
Learning Ensembles of Structured Prediction Rules. ACL (1) 2014: 1-12 - [c3]Vitaly Kuznetsov, Mehryar Mohri:
Generalization Bounds for Time Series Prediction with Non-stationary Processes. ALT 2014: 260-274 - [c2]Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri:
Ensemble Methods for Structured Prediction. ICML 2014: 1134-1142 - [c1]Vitaly Kuznetsov, Mehryar Mohri, Umar Syed:
Multi-Class Deep Boosting. NIPS 2014: 2501-2509 - 2013
- [i1]Abraham Isgur, Vitaly Kuznetsov, Mustazee Rahman
, Stephen M. Tanny:
Nested Recursions, Simultaneous Parameters and Tree Superpositions. CoRR abs/1301.5055 (2013)
Coauthor Index
![](https://dblp.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-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint