Deep learning-based representation learning, using autoencoders and probabilistic models, enhances feature extraction and model generalization.

Yoshua Bengio, Aaron Courville, Pascal Vincent

Proposes a nonparametric RKHS embedding approach for modeling MDP transition dynamics, outperforming Gaussian processes and NPDP in efficiency and accuracy.

Steffen Grunewalder, Guy Lever, Luca Baldassarre et al.

Proposes a training-data-driven expert learning algorithm with context trees for improved short-sequence prediction.

Elad Eban, Aharon Birnbaum, Shai Shalev-Shwartz et al.

Koopman operator-based spectral analysis enables nonlinear system modal decomposition from data, improving high-dimensional understanding.

Marko Budišić, Ryan M. Mohr, Igor Mezić

The paper proposes a Bayesian optimization method using Gaussian processes, significantly enhancing hyperparameter tuning efficiency for ML algorithms.

Jasper Snoek, Hugo Larochelle, Ryan P. Adams

Proves Krivine schemes are asymptotically optimal for approximating the Grothendieck constant KG, with error (1+O(1/k)).

Assaf Naor, Oded Regev

Proposes a compressed sensing-based robust state estimator capable of tolerating up to p/2-1 sensor attacks, enhancing system security.

Hamza Fawzi, Paulo Tabuada, Suhas Diggavi

Revealed the equivalence between conditional mean embeddings and vector-valued regression, achieving near-optimal convergence rate of O(log(n)/n) with sparse regularization.

Steffen Grünewälder, Guy Lever, Luca Baldassarre et al.

This paper rigorously analyzes regret bounds for stochastic and adversarial multi-armed bandits, establishing near-optimal guarantees for UCB and Exp3 algorithms.

Sébastien Bubeck, Nicolò Cesa-Bianchi

Proposes a quantum algorithm leveraging HHL to efficiently assess least-squares fit quality over exponentially large datasets.

Nathan Wiebe, Daniel Braun, Seth Lloyd

Experiments plus Keller–Segel theory show chemically mediated clustering, with mean cluster size N* increasing linearly with swimming speed V.

I. Theurkauff, C. Cottin-Bizonne, J. Palacci et al.

Introduces a linear combination-based Hamiltonian simulation algorithm with complexity O(m²hte^{1.6√log(mht/ε)}), outperforming product formulas.

Andrew M. Childs, Nathan Wiebe

Proposes a ridge regression-based p-value method for high-dimensional linear models with strong error control, suitable for single and multiple hypotheses.

Peter Bühlmann

Select high-dimensional features using feature-wise kernelized Lasso, significantly improving non-linear dependency feature selection efficiency.

Makoto Yamada, Wittawat Jitkrittum, Leonid Sigal et al.

Scikit-learn is a Python library integrating state-of-the-art ML algorithms like SVM and PCA, emphasizing usability and performance.

Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort et al.

Large-scale unsupervised deep autoencoder trained on 10 million images achieves high-level feature detection, boosting ImageNet accuracy by 70%.

Quoc V. Le, Marc'Aurelio Ranzato, Rajat Monga et al.

Entropy Search algorithm optimizes global search by maximizing information gain, enhancing efficiency.

Philipp Hennig, Christian J. Schuler

The No-U-Turn Sampler (NUTS) enhances HMC efficiency by adaptively setting path lengths.

Matthew D. Hoffman, Andrew Gelman

Proposes an efficient nonparametric conformal prediction method combining kernel density estimation, guaranteeing finite-sample coverage with explicit convergence rates.

Jing Lei, James Robins, Larry Wasserman

SATzilla employs empirical hardness models for dynamic SAT instance algorithm selection, significantly improving solving efficiency.

Lin Xu, Frank Hutter, Holger H. Hoos et al.