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,742 papers · 148 categories

Trend · papers per month

87174261348 · May 202619922001200920172026
48 results for predictor dependencies

DynForest R package predicts outcomes with time-dependent predictors.

problem Handling time-dependent predictors in random forest models.
method Random forests with time-dependent predictors summarized using flexible linear mixed models.
result DynForest can predict continuous, categorical, and survival outcomes.

The article compares predictor importance in classification problems with categorical outcomes.

problem Comparing predictor importance in classification problems with categorical response variables.
method The approach is based on the categorical Gini correlation (CGC) and tests differences in CGCs across predictor groups.
result The proposed methodology accommodates predictors of arbitrary and unequal dimensions and allows for dependence between predictor groups.

Paper introduces SUEL model for integrating predictors without labeled data.

problem Combining predictors with unknown accuracy and high correlation.
method Structured unsupervised ensemble learning (SUEL) with correlation-based decomposition algorithms.
result Efficient integration of dependent predictors without labeled data.

New bounds explain deterministic non-smooth deep nets without large Lipschitz constants.

problem Challenges in explaining generalization of deterministic non-smooth deep nets.
method De-randomized PAC-Bayes margin bounds for deterministic non-convex and non-smooth predictors.
result New bounds avoid large Lipschitz constants, providing generalization guarantees.

Kernel Three-Pass Regression Filter improves forecasting efficiency for nonlinear dependencies.

problem Forecasting with high-dimensional predictors and latent factors.
method Developed a new estimator, Kernel Three-Pass Regression Filter (K3PRF), to address nonlinear dependencies.
result Empirically shows significant improvement in long-term forecasting performance.

We consider a problem of data integration. Consider determining which genes affect a disease. The genes, which we call predictor objects, can be measured in different experiments on the same individual. We address the question of finding which genes are predictors of disease by any of the experiments. Our formulation i…

2016-10-03abs ↗pdf ↗

Although there is a rich literature on methods for allowing the variance in a univariate regression model to vary with predictors, time and other factors, relatively little has been done in the multivariate case. Our focus is on developing a class of nonparametric covariance regression models, which allow an unknown p …

2011-01-11abs ↗pdf ↗

Proposes a method to create fair, robust predictors that remain consistent across different scenarios.

problem Creating fair and robust machine learning models that behave consistently across different scenarios.
method Graphical criteria and a model-agnostic framework called CIP based on HSCIC.
result Demonstrates the effectiveness of CIP in enforcing counterfactual invariance across various datasets.

Fairness measures fail in predictive settings that intentionally shift outcomes.

problem Fairness measures fail in performative prediction settings.
method Formalized concept shift and counterfactual outcomes.
result Predictors that are fair during training become unfair during deployment.

Learning linear predictors with the logistic loss---both in stochastic and online settings---is a fundamental task in machine learning and statistics, with direct connections to classification and boosting. Existing "fast rates" for this setting exhibit exponential dependence on the predictor norm, and Hazan et al. (20…

2018-03-25abs ↗pdf ↗

New sample complexity bounds for linear predictors and neural networks, focusing on initialization.

problem Understanding sample complexity for vector-valued linear predictors and neural networks, especially under initialization-dependent conditions.
method Size-independent bounds on Frobenius norm distance from a fixed reference matrix, applying to vector-valued predictors and neural networks.
result Established new sample complexity bounds for feed-forward neural networks, resolving open questions and introducing a new learnable problem.

Study shows how to improve contextual bandits with loss predictors.

problem Improving minimax regret in contextual bandits with loss predictors.
method Developed novel algorithmic techniques for upper bounds and lower bounds in various settings.
result Optimal regret is O(min{T,ET14})\mathcal{O}(\min\{\sqrt{T}, \sqrt{\mathcal{E}}T^\frac{1}{4}\}) when E\mathcal{E} is known, and O(ET13)\mathcal{O}(\sqrt{\mathcal{E}}T^\frac{1}{3}) if E\mathcal{E} is unknown.

Adaptive kernels from neural networks improve model performance.

problem Improving neural network performance through adaptive kernels.
method Deriving adaptive kernels from infinite-width neural networks using feature learning and gradient flow training.
result Adaptive kernels achieve lower test loss compared to traditional kernels.

New method predicts spatio-temporal data with short and long-range dependence.

problem Uncertainty in predicting the distribution of mixed moving average fields.
method Theory-guided machine learning approach using generalized Bayesian algorithm.
result Fixed-time and any-time PAC Bayesian bounds for ensemble forecasts.

New method uses quotient predictor space for better PAC-Bayes bounds, reducing KL divergence and improving model performance.

problem Overparameterized models with continuous symmetries can lead to biased predictions.
method Perform PAC-Bayesian analysis on quotient predictor space, constructing a canonical prior that reflects model's implicit bias.
result The new prior reduces KL divergence and improves model performance in experiments.

Split conformal prediction works well for time series despite temporal dependence.

problem Uncertainty quantification for time series predictions with past data.
method Split conformal prediction method for time series data with predictors having memory.
result Theoretical bounds on coverage probability for split conformal prediction in time series with memory.

The paper explores why a specific type of predictor works well in noisy data.

problem Understanding why a specific type of predictor (minimum-norm interpolator) works well in noisy data.
method The paper uses uniform convergence and zero-error predictors in a norm ball to explain the success of the minimum-norm interpolator.
result The minimum-norm interpolator is consistent, and this can be explained by uniform convergence of zero-error predictors in a norm ball.

The paper develops a deep neural network estimator for weakly dependent processes with various loss functions.

problem Learning weakly dependent processes with a broad class of loss functions.
method Sparse-penalized deep neural networks with ψψ-weak dependence structure and θθ_\infty-coefficients.
result Oracle inequalities for the excess risk of the sparse-penalized deep neural networks estimators.

Modern bio-technologies have produced a vast amount of high-throughput data with the number of predictors far greater than the sample size. In order to identify more novel biomarkers and understand biological mechanisms, it is vital to detect signals weakly associated with outcomes among ultrahigh-dimensional predictor…

2018-05-17abs ↗pdf ↗

Study shows linear predictors fail with missing data, but simpler approximations and neural networks can work.

problem Building predictors with missing data when the target is a linear function of observed data.
method Analyzed the Gaussian case and proposed a linear function of multiway interactions. Studied a simple approximation and proved generalization bounds. Showed multilayer perceptrons with ReLU activation can be consistent.
result Simple approximations and neural networks can be effective in handling missing data, especially with sufficient data.

Deep neural networks estimate regression functions on manifolds.

problem Estimating regression functions on manifolds from data.
method Fully connected deep neural networks with ReLU activation, analyzing convergence rates.
result Estimates achieve a rate of convergence dependent on manifold dimension, not predictor dimension.

Bayesian neural networks explore rare fluctuations for better feature learning.

problem Understanding rare but dominant fluctuations in Bayesian neural networks.
method Large-deviation theory and joint optimization over predictors and internal kernels.
result Posterior rate function optimization reveals data-dependent kernel selection.

We study online linear regression problems in a distributed setting, where the data is spread over a network. In each round, each network node proposes a linear predictor, with the objective of fitting the \emph{network-wide} data. It then updates its predictor for the next round according to the received local feedbac…

2019-02-13abs ↗pdf ↗

New methods for CI testing under model misspecification.

problem Challenges in CI testing with misspecified models.
method Proposes new approximations and upper bounds for testing errors of regression-based CI tests.
result Introduces the Rao-Blackwellized Predictor Test (RBPT) robust against misspecified inductive biases.

New theory explains how noisy, high-dimensional data can still lead to robust predictions.

problem Modern machine learning models achieve high performance with noisy, high-dimensional data.
method Synthesizes principles from Information Theory, Latent Factor Models, and Psychometrics to clarify predictive robustness.
result Predictive robustness arises from data architecture and model capacity, not just data cleanliness.

DynForest predicts event probabilities from longitudinal data, handling endogenous predictors.

problem Predicting individual risk using longitudinal patient history.
method Random survival forests with time-fixed features from longitudinal predictors.
result DynForest provides accurate individual event probability predictions.

In this work, we propose the kernel Pitman-Yor process (KPYP) for nonparametric clustering of data with general spatial or temporal interdependencies. The KPYP is constructed by first introducing an infinite sequence of random locations. Then, based on the stick-breaking construction of the Pitman-Yor process, we defin…

2012-10-15abs ↗pdf ↗

Bayes predictor remains robust to ignorable missingness shifts.

problem Challenges in prediction with missing covariates and shifts in missingness reasons.
method Bayesian approach and different prediction methods.
result Bayes predictor remains unchanged by ignorable shifts, but robust prediction requires disregarding missingness for non-ignorable shifts.

GIDS reduces high-dimensional response and predictor spaces, improving interpretability and computational efficiency.

problem Challenges in modeling interactions among high-dimensional multimodal data.
method Graph Independence Dual Screening (GIDS) framework that reduces both response and predictor dimensions.
result GIDS reduces feature space to 9,000 CpGs and 2,000 transcripts, revealing coordinated regulatory mechanisms.

Forecasting a time series from multivariate predictors constitutes a challenging problem, especially using model-free approaches. Most techniques, such as nearest-neighbor prediction, quickly suffer from the curse of dimensionality and overfitting for more than a few predictors which has limited their application mostl…

2015-06-18abs ↗pdf ↗

New bounds show linear predictors rarely overfit with certain optimization methods.

problem Bounding test error for linear predictors with stochastic optimization methods.
method Coupling argument for fixed point methods like stochastic and batch mirror descent.
result Locally-adapted rates that depend on predictor properties, not global problem structure.

Sparse model selection by structural risk minimization leads to a set of a few predictors, ideally a subset of the true predictors. This selection clearly depends on the underlying loss function L~\tilde L. For linear regression with square loss, the particular (functional) Gradient Boosting variant L2L_2-Boosting exce…

2019-09-24abs ↗pdf ↗

The paper decomposes probabilistic scores into reliability, uncertainty, and information loss.

problem Understanding the reliability and uncertainty of probabilistic predictions.
method Developed decomposition identities for proper losses, quantifying reliability, residual uncertainty, and information gain.
result A three-term identity for classification scores, revealing miscalibration, grouping term, and feature-level uncertainty.

DFR models dynamic distributional data with weighted Fréchet means.

problem Regression of distribution-valued responses over time.
method Dynamic Fréchet Regression (DFR) with index-aware weighting and feature selection.
result Improved predictive accuracy and feature recovery over existing methods.