Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

3.7%7.4%11.2%14.9% · Jun 202019922001200920172026
48 results for supervised regression

Paper introduces semi-supervised linear extremile regression for high-dimensional data.

problem Challenges in high-dimensional extremile regression due to data sparsity and overfitting.
method Proposes semi-supervised learning for linear extremile regression, achieving n\sqrt{n}-consistency.
result Demonstrates improved estimation efficiency and performance in high-dimensional settings.

Study semi-supervised learning with noisy proxy covariates, deriving bounds and showing gains.

problem Learning from noisy proxy covariates with scarce labels.
method Two-stage estimator learning kernel eigenfeatures from all proxy covariates and fitting a ridge predictor on labeled data.
result Finite sample bounds show fast labeled sample rates and consistent gains over supervised and semi-supervised baselines.

Paper tackles RUL prediction with scarce data using indirect supervision.

problem Predicting RUL with indirect supervision and scarce time series data.
method Unified framework called parameterized static regression, handling data scarcity without interpolation.
result Competitive performance in prediction accuracy with simulated data scarcity.

Survey of SDR methods for high-dimensional regression and embedding.

problem Reducing dimensionality in high-dimensional data.
method Involves both statistical and machine learning approaches, covering inverse and forward regression methods.
result Supervised Kernel Dimension Reduction is equivalent to supervised PCA.

ETM models improve efficiency in semi-supervised logistic regression.

problem Improving efficiency in logistic regression with limited labeled data.
method Developed exponential tilt mixture (ETM) models for semi-supervised estimation.
result ETM-based estimation demonstrates improved efficiency over supervised logistic regression.

New method shows supervised learning can mimic unsupervised learning effectively.

problem The fundamental difference between supervised and unsupervised learning.
method A two-stage procedure where unsupervised model selection is followed by adding outputs without changing parameters.
result Asymptotic out-of-sample risk bounds for various models trained without access to labels.

Semi-supervised learning improves prediction using unlabeled data.

problem Improving prediction performance using unlabeled data.
method General methodology for semi-supervised Empirical Risk Minimization (ERM) focusing on generalized linear regression.
result Adaptive SSL can achieve substantial improvement over supervised and null models in various settings.

Bayesian Topic Regression models causal inference with text and numerical data.

problem Causal inference using observational text data with both text and numerical confounders.
method Combines supervised Bayesian topic model with Bayesian regression framework, respecting the Frisch-Waugh-Lovell theorem.
result Joint approach recovers ground truth with lower bias than benchmarks, superior prediction results compared to separate approaches.

Simplifies transfer learning with deep neural networks using ridge regression.

problem High computational cost of finetuning deep models for transfer learning.
method Leverage the low-rank property of deep neural networks' feature vectors in kernel ridge regression.
result Successful on supervised and semi-supervised transfer learning tasks.

This paper presents Correlated Nystrom Views (XNV), a fast semi-supervised algorithm for regression and classification. The algorithm draws on two main ideas. First, it generates two views consisting of computationally inexpensive random features. Second, XNV applies multiview regression using Canonical Correlation Ana…

2013-06-24abs ↗pdf ↗

New method estimates covariance in deep heteroscedastic regression without labels.

problem Estimating covariance in deep heteroscedastic models is challenging due to sample-dependent covariance and lack of ground truth.
method Proposes a self-supervised approach using KL Divergence and 2-Wasserstein distance for covariance estimation and a neighborhood-based heuristic for pseudo labels.
result Demonstrates effective pseudo labels and a computationally cheaper yet accurate deep heteroscedastic regression.

Unified framework for semi-supervised regression with misspecified models.

problem Estimating regression coefficients in conditional mean models with unlabeled data.
method Developed an augmented inverse probability weighted (AIPW) method using regularized calibrated estimators for PS and OR nuisance models.
result The proposed estimator is consistent, asymptotically normal, and provides valid confidence intervals even with misspecified OR models and high-dimensional data.

Data-dependent hashing has recently attracted attention due to being able to support efficient retrieval and storage of high-dimensional data such as documents, images, and videos. In this paper, we propose a novel learning-based hashing method called "Supervised Discrete Hashing with Relaxation" (SDHR) based on "Super…

2019-04-07abs ↗pdf ↗

We address the problem of general supervised learning when data can only be accessed through an (indefinite) similarity function between data points. Existing work on learning with indefinite kernels has concentrated solely on binary/multi-class classification problems. We propose a model that is generic enough to hand…

2012-10-22abs ↗pdf ↗

Method improves regression models using unlabeled data.

problem Improving predictive performance of regression models with limited labeled data.
method Mixed semi-supervised generalized-linear-regression with different mixing mechanisms.
result Integrating unlabeled data consistently improves predictive performance.

Solves weakly supervised regression using low-rank approximations and manifold regularization.

problem Weakly supervised regression with known, unknown, and uncertain labels.
method Combines manifold regularization and low-rank matrix decomposition for optimization.
result Improves solution quality and stability for large datasets.

SDORE uses neural networks to estimate regression functions and their gradients, even with limited labeled data.

problem Nonparametric estimation of regression functions and their gradients.
method Semi-supervised deep ReQU neural networks with gradient norm regularization.
result Achieves minimax optimal convergence rates in L2L^{2}-norm and plug-in gradient estimator convergence.

SEMF predicts prediction intervals for ML models using latent variables.

problem Uncertainty quantification in ML models, especially for diverse data distributions.
method Supervised Expectation-Maximization Framework (SEMF) extending EM algorithm for latent variable modeling.
result SEMF produces narrower prediction intervals with desired coverage probability.

This work analyzes the role of data augmentation in self-supervised learning using RKHS approximation and regression.

problem Limited theoretical understanding of the role of data augmentation in self-supervised learning.
method Geometric characterization of the target function given by augmentation, proving generalization bounds.
result Two generalization bounds are derived, one free of model complexity, the other specific to near-optimal encoders.

Optimal and safe semi-supervised learning estimator for high-dimensional data.

problem Improving regression parameter estimation with unlabeled data in high-dimensional settings.
method Established minimax lower bound, proposed optimal and safe semi-supervised estimators.
result Optimal semi-supervised estimator achieves the minimax lower bound.

Study on reducing dimensionality in high-dimensional regression with kernel methods and stability analysis.

problem Analyzing errors in high-dimensional regression with dimensionality reduction and kernel regression.
method Derive a stability result for kernel regression with Wasserstein distance and apply it to PCA to deduce convergence rates.
result Two-step procedure yields useful convergence rates in semi-supervised settings.

We propose the supervised hierarchical Dirichlet process (sHDP), a nonparametric generative model for the joint distribution of a group of observations and a response variable directly associated with that whole group. We compare the sHDP with another leading method for regression on grouped data, the supervised latent…

2014-12-17abs ↗pdf ↗

Study compares non-parametric models for predicting medical insurance reimbursement delays.

problem Estimating the time-lapse between medical insurance reimbursement.
method Comparative study of four non-parametric regression models (KNNs, SVMs, Decision Trees, Random Forests) using R-squared metric.
result Each model's performance varies with training data size, feature space, and hyperparameters.

New method uses unlabeled data to estimate intercept in case-control logistic regression.

problem Estimating intercept in case-control logistic regression.
method Construct likelihood function, use iterative algorithm to find maximum likelihood estimator.
result Proposed method identifies intercept and improves estimation efficiency.

Study shows how varying levels of supervision and orthonormality constraints affect generalization errors in subspace fitting.

problem Effects of varying levels of supervision and orthonormality constraints on generalization errors in subspace fitting.
method Flexible family of problems connecting unsupervised and supervised subspace fitting tasks, explored over a supervision-orthonormality plane.
result Generalization errors of subspace fitting problems follow double descent trends as they become more supervised and less orthonormally constrained.

Proposes deep quantile regression for uncertainty estimation in lesion detection.

problem Uncertainty quantification in lesion detection for critical applications.
method Quantile regression for aleatoric uncertainty, Variational AutoEncoder (VAE) with QR-VAE, binary quantile regression (BQR).
result Effective quantification of uncertainty in lesion detection and segmentation.

iRDM selects unlabeled samples for regression without labels, improving model accuracy.

problem Selecting unlabeled samples for regression without label information.
method Iterative representativeness-diversity maximization (iRDM).
result iRDM significantly outperforms supervised ALR, especially with limited labeled samples.

UCSL combines clustering with supervised learning to discover interpretable subtypes.

problem Discovering interpretable subtypes in datasets relevant to supervised tasks.
method UCSL (Unsupervised Clustering driven by Supervised Learning) framework integrating clustering and supervised learning.
result UCSL achieves +1.9 points in balanced accuracy for psychiatric diseases clustering.

New algorithm tackles regression on manifold data using diffusion and semi-supervised learning.

problem Regression on high-dimensional manifold data with complex structures.
method Diffusion-based spectral algorithm using graph Laplacian and heat kernel.
result Algorithm achieves convergence rate dependent on intrinsic manifold dimension, avoiding curse of dimensionality.

Develops a framework for fair semi-supervised learning.

problem Balancing fairness and accuracy in semi-supervised learning.
method Formulates a framework as an optimization problem, incorporating classifier loss, label propagation loss, and fairness constraints.
result Achieves fair semi-supervised learning with better accuracy-fairness trade-off than fair supervised learning.

Recently there has been substantial interest in spectral methods for learning dynamical systems. These methods are popular since they often offer a good tradeoff between computational and statistical efficiency. Unfortunately, they can be difficult to use and extend in practice: e.g., they can make it difficult to inco…

2015-05-20abs ↗pdf ↗

The effectiveness of supervised learning techniques has made them ubiquitous in research and practice. In high-dimensional settings, supervised learning commonly relies on dimensionality reduction to improve performance and identify the most important factors in predicting outcomes. However, the economic importance of …

2016-08-07abs ↗pdf ↗

GNNs improve semi-supervised node regression, but why? We explain.

problem Understanding when and why GNNs succeed in semi-supervised node regression.
method Aggregate-and-readout model encompassing message passing architectures, least-squares estimation over GNNs with linear graph convolutions and a deep ReLU readout.
result Sharp non-asymptotic risk bound separating approximation, stochastic, and optimization errors.