arXiv research

New models automate support group formation in online health communities.

Efficiently handles large support vectors in kernelized online learning.

A new method combines online and offline learning to tackle contextual bandits with missing action support.

Kernel-based online learning has often shown state-of-the-art performance for many online learning tasks. It, however, suffers from a major shortcoming, that is, the unbounded number of support vectors, making it non-scalable and unsuitable for applications with large-scale datasets. In this work, we study the problem …

Improved mistake bound for group linear separable cases in online multiclass linear classification.

AIHT improves online high-dimensional quantile regression by separating support discovery and refinement.

In this work, we design a machine learning based method, online adaptive primal support vector regression (SVR), to model the implied volatility surface (IVS). The algorithm proposed is the first derivation and implementation of an online primal kernel SVR. It features enhancements that allow efficient online adaptive …

Develops platforms to analyze social media data for human behavior and emotions.

Bayesian method improves multivariate periodontal outcome modeling.

Current online learning methods suffer issues such as lower convergence rates and limited capability to select important features compared to their offline counterparts. In this paper, a novel framework for online learning based on running averages is proposed. Many popular offline regularized methods such as Lasso, El…

Optimal learning for parametric prophet inequalities with exponential-type distributions

Online selection of dynamic features has attracted intensive interest in recent years. However, existing online feature selection methods evaluate features individually and ignore the underlying structure of feature stream. For instance, in image analysis, features are generated in groups which represent color, texture…

This paper improves online learning algorithms for LP problems, achieving better regret bounds.

In this paper, we focus on online representation learning in non-stationary environments which may require continuous adaptation of model architecture. We propose a novel online dictionary-learning (sparse-coding) framework which incorporates the addition and deletion of hidden units (dictionary elements), and is inspi…

OOMP selects features online for sparse linear regression.

New insights link no-regret learning to online conformal prediction in adversarial settings.

GLCB uses Gated Linear Networks for online contextual bandits.

Sparsity learning with known grouping structure has received considerable attention due to wide modern applications in high-dimensional data analysis. Although advantages of using group information have been well-studied by shrinkage-based approaches, benefits of group sparsity have not been well-documented for greedy-…

New algorithms achieve small prediction regret for learning from overlapping groups.

OneShotSTL efficiently decomposes time series online, improving speed and accuracy.

Model-based planning holds great promise for improving both sample efficiency and generalization in reinforcement learning (RL). We show that energy-based models (EBMs) are a promising class of models to use for model-based planning. EBMs naturally support inference of intermediate states given start and goal state dis…

Develops MGQDA for multi-group classification with theoretical guarantees and practical applications.

EnsembleSVM is a free software package containing efficient routines to perform ensemble learning with support vector machine (SVM) base models. It currently offers ensemble methods based on binary SVM models. Our implementation avoids duplicate storage and evaluation of support vectors which are shared between constit…

The paper addresses errors in online selective conformal prediction and proposes new strategies to ensure valid inference.

In recent years, distance education has enjoyed a major boom. Much work at The Open University (OU) has focused on improving retention rates in these modules by providing timely support to students who are at risk of failing the module. In this paper we explore methods for analysing student activity in online virtual l…

The paper explores the transitivity of orbifold diffeomorphisms.

SGD noise has no bias advantage in online learning, contrary to offline learning.

Paper proposes a machine learning method to predict sale efficacy.

Paper proposes an online speech recognition model using Transformer.

Paper proves tight lower bounds for online multicalibration, separating it from marginal calibration.

New algorithm provides robust uncertainty quantification without parameter tuning.

Bayesian inference provides an attractive online-learning framework to analyze sequential data, and offers generalization guarantees which hold even with model mismatch and adversaries. Unfortunately, exact Bayesian inference is rarely feasible in practice and approximation methods are usually employed, but do such met…

An online decision-making algorithm using stochastic gradient descent for big data.

Study on online nonparametric regression using Sobolev kernel methods.

Optimizes crowdsourced preference-based subjective evaluation with online learning.

In this paper we propose a fast online Kernel SVM algorithm under tight budget constraints. We propose to split the input space using LVQ and train a Kernel SVM in each cluster. To allow for online training, we propose to limit the size of the support vector set of each cluster using different strategies. We show in th…

Paper presents novel online MTL methods using WRLS and OSLSSVR.

The study predicts how discussions in mental disorder Reddit communities affect users' emotional states.

Wide and Deep GNN learns from distributed graphs and retrain online.

New framework for fair online allocation in continuous time with deadlines.

Multitwists cannot generate all compactly supported mapping class groups on infinite-type surfaces.

The paper presents a method for personalized exercise recommendations that improves learner skill gain.

Excessive computational cost for learning large data and streaming data can be alleviated by using stochastic algorithms, such as stochastic gradient descent and its variants. Recent advances improve stochastic algorithms on convergence speed, adaptivity and structural awareness. However, distributional aspects of thes…

When faced with high frequency streams of data, clustering raises theoretical and algorithmic pitfalls. We introduce a new and adaptive online clustering algorithm relying on a quasi-Bayesian approach, with a dynamic (i.e., time-dependent) estimation of the (unknown and changing) number of clusters. We prove that our a…

OKDDip uses diverse peers to improve online knowledge distillation.

Develops a new method for online conformal prediction without manual tuning.

Global convergence of an online (stochastic) limited memory version of the Broyden-Fletcher- Goldfarb-Shanno (BFGS) quasi-Newton method for solving optimization problems with stochastic objectives that arise in large scale machine learning is established. Lower and upper bounds on the Hessian eigenvalues of the sample …

High-velocity streams of high-dimensional data pose significant "big data" analysis challenges across a range of applications and settings. Online learning and online convex programming play a significant role in the rapid recovery of important or anomalous information from these large datastreams. While recent advance…