ICML 2023 Papers

International Conference on Machine Learning

Decision breakdown

1,865papers

Counted from the official paper list; may differ slightly from the number the conference announced.

  • Oral
    1558.3%
  • Poster
    1,71091.7%

Browse all papers

Bayesian online change point detection with Hilbert space approximate Student-t process

Jeremy Sellier, Petros Dellaportas

Expand abstract

In this paper, we introduce a variant of Bayesian online change point detection with a reducedrank Student-t process (TP) and dependent Student-t noise, as a nonparametric time series model. Our method builds and improves upon the state-of-the-art Gaussian process (GP) change point model benchmark of Saatci et al. (2010). The Student-t process generalizes the concept of a GP and hence yields a more flexible alternative. Additionally, unlike a GP, the predictive variance explicitly depends on the training observations, while the use of an entangled Student-t noise model preserves analytical tractability. Our approach also uses a Hilbert space reduced-rank representation of the TP kernel, derived from an eigenfunction expansion of the Laplace operator (Solin & Sarkka, 2020), to alleviate its computational complexity. Improvements in prediction and training time are demonstrated with real-world data-sets

Poster
Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA

Ilias Diakonikolas, Daniel Kane, Ankit Pensia, Thanasis Pittas

Expand abstract

We study principal component analysis (PCA), where given a dataset in $\mathbb R^d$ from a distribution, the task is to find a unit vector $v$ that approximately maximizes the variance of the distribution after being projected along $v$. Despite being a classical task, standard estimators fail drastically if the data contains even a small fraction of outliers, motivating the problem of robust PCA. Recent work has developed computationally-efficient algorithms for robust PCA that either take super-linear time or have sub-optimal error guarantees. Our main contribution is to develop a nearly linear time algorithm for robust PCA with near-optimal error guarantees. We also develop a single-pass streaming algorithm for robust PCA with memory usage nearly-linear in the dimension.

Poster