Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Yacov Crammer

dblp:346/0958 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 70% Probabilistic and Bayesian machine learning · 30%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › statistical learning theory
finite-sample analysis
0.612022
Finite Sample Analysis Of Dynamic Regression Parameter Learning · NeurIPS 2022
Machine learning › Learning theory
statistical learning theory
0.612022
Finite Sample Analysis Of Dynamic Regression Parameter Learning · NeurIPS 2022
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
variance estimation
0.612022
Finite Sample Analysis Of Dynamic Regression Parameter Learning · NeurIPS 2022

Methods — techniques the papers use, named apart from their topics

sub-gaussian distribution analysis · 0.6
YearPublicationVenuePosition
2022 Finite Sample Analysis Of Dynamic Regression Parameter Learning
abstract
We consider the dynamic linear regression problem, where the predictor vector may vary with time. This problem can be modeled as a linear dynamical system, with non-constant observation operator, where the parameters that need to be learned are the variance of both the process noise and the observation noise. While variance estimation for dynamic regression is a natural problem, with a variety of applications, existing approaches to this problem either lack guarantees altogether, or only have asymptotic guarantees without explicit rates. In particular, existing literature does not provide any clues to the following fundamental question: In terms of data characteristics, what does the convergence rate depend on? In this paper we study the global system operator -- the operator that maps the noise vectors to the output. We obtain estimates on its spectrum, and as a result derive the first known variance estimators with finite sample complexity guarantees. The proposed bounds depend on the shape of a certain spectrum related to the system operator, and thus provide the first known explicit geometric parameter of the data that can be used to bound estimation errors. In addition, the results hold for arbitrary sub Gaussian distributions of noise terms. We evaluate the approach on synthetic and real-world benchmarks.
Mark Kozdoba, Edward Moroshko, Shie Mannor, Yacov Crammer
NeurIPS4