Consistent online gaussian process regression without the sample complexity bottleneck

A Koppel, H Pradhan, K Rajawat - Statistics and Computing, 2021 - Springer
Gaussian processes provide a framework for nonlinear nonparametric Bayesian inference
widely applicable across science and engineering. Unfortunately, their computational …

An enhanced gated recurrent unit with auto-encoder for solving text classification problems

M Zulqarnain, R Ghazali, YMM Hassim… - Arabian Journal for …, 2021 - Springer
Classification has become an important task for automatically categorizing documents
based on their respective group. The purpose of classification is to assign the pre-specified …

Dynamic online learning via Frank-Wolfe algorithm

DS Kalhan, AS Bedi, A Koppel… - IEEE Transactions …, 2021 - ieeexplore.ieee.org
Online convex optimization (OCO) encapsulates supervised learning when training sets are
large-scale or dynamic, and has grown essential as data has proliferated. OCO decomposes …

Kernel-based smoothness analysis of residual networks

T Tirer, J Bruna, R Giryes - Mathematical and Scientific …, 2022 - proceedings.mlr.press
A major factor in the success of deep neural networks is the use of sophisticated
architectures rather than the classical multilayer perceptron (MLP). Residual networks …

Stochastic policy gradient ascent in reproducing kernel hilbert spaces

S Paternain, JA Bazerque, A Small… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Reinforcement learning consists of finding policies that maximize an expected cumulative
long-term reward in a Markov decision process with unknown transition probabilities and …

Projected stochastic primal-dual method for constrained online learning with kernels

A Koppel, K Zhang, H Zhu… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
We consider the problem of stochastic optimization with nonlinear constraints, where the
decision variable is not vector-valued but instead a function belonging to a reproducing …

[HTML][HTML] An online projection estimator for nonparametric regression in reproducing kernel hilbert spaces

T Zhang, N Simon - Statistica Sinica, 2023 - ncbi.nlm.nih.gov
The goal of nonparametric regression is to recover an underlying regression function from
noisy observations, under the assumption that the regression function belongs to a …

Ahpatron: A New Budgeted Online Kernel Learning Machine with Tighter Mistake Bound

Y Liao, J Li, S Liao, Q Hu, J Dang - … of the AAAI Conference on Artificial …, 2024 - ojs.aaai.org
In this paper, we study the mistake bound of online kernel learning on a budget. We propose
a new budgeted online kernel learning model, called Ahpatron, which significantly improves …

Policy evaluation in continuous MDPs with efficient kernelized gradient temporal difference

A Koppel, G Warnell, E Stump, P Stone… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
We consider policy evaluation in infinite-horizon discounted Markov decision problems with
continuous compact state and action spaces. We reformulate this task as a compositional …

Optimally compressed nonparametric online learning: Tradeoffs between memory and consistency

A Koppel, AS Bedi, K Rajawat… - IEEE Signal Processing …, 2020 - ieeexplore.ieee.org
Batch training of machine learning models based on neural networks is well established,
whereas, to date, streaming methods are largely based on linear models. To go beyond …