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

Trend · papers per month

54109163217 · Jun 202019922001200920172026
48 results for variance-weighted regression

R-Learning uses inverse-variance weights to estimate treatment effects more accurately.

problem Estimating heterogeneous treatment effects (CATEs) with stable and accurate methods.
method R-Learning with inverse-variance weights (IVWs) for pseudo-outcome regression.
result IVWs improve the stability and accuracy of CATE estimation.

The paper develops a robust algorithm for contextual bandits with heavy-tailed rewards.

problem Contextual bandits with heavy-tailed rewards.
method Develops an algorithm based on Catoni's estimator for robust statistics, applying it to contextual bandits with general function approximation.
result Establishes regret bounds that depend on cumulative reward variance and logarithmically on the reward range and number of rounds.

New algorithm reduces RL complexity with low switching costs.

problem Exploration-exploitation dilemma in RL with complex models.
method Monotonic Q-Learning with Upper Confidence Bound (MQL-UCB) for RL with general function approximation.
result Achieves minimax optimal regret of O(dHK)O(d\sqrt{HK}) and near-optimal policy switching cost.

Bayesian deep neural networks converge to processes with α-stable marginals under infinite variance weights.

problem Representation learning in deep kernel processes is hindered by deterministic covariance kernels.
method Showed convergence to α-stable processes with conditionally Gaussian representations in infinite-width networks.
result Conditional random covariance kernels can be recursively linked, even if the process is α-stable.

Enhances reinforcement learning uncertainty estimation with a generalized Gaussian error model.

problem Inaccurate error representations and compromised uncertainty estimation in conventional uncertainty-aware TD learning.
method Introduces a novel framework for generalized Gaussian error modeling in deep reinforcement learning, incorporating higher-order moments, particularly kurtosis, to improve uncertainty estimation and mitigation.
result Significant performance gains in policy gradient algorithms with the proposed framework.

We derive valuations of a portfolio of financial instruments from a securities lending perspective, under different assumptions, and show a weighting scheme that converges to the true valuation. We illustrate conditions under which our alternative weighting scheme converges faster to the true valuation when compared to…

2016-03-03abs ↗pdf ↗

AugMask trains diffusion models on incomplete tabular data by augmenting missing values and applying denoising supervision.

problem Training diffusion models on incomplete tabular data with missing values.
method AugMask uses stochastic augmentation and denoising supervision to adapt diffusion models to incomplete data.
result AugMask enables diffusion-based tabular generators to outperform specialized missing-aware baselines across various datasets and missingness regimes.

Analyzes how diffusion models learn, revealing a spectral bias in structure mastery.

problem Understanding the learning dynamics and bias in diffusion models.
method Developed an analytical framework using a Gaussian-equivalence principle to solve gradient-flow dynamics and integrate probability-flow ODEs.
result Exposes a universal inverse-variance spectral law: high-variance structure is mastered faster than low-variance detail.

Framework for precise recall control in spatial conflation tasks.

problem Precise recall control in large-scale spatial conflation tasks to avoid downstream analytics failures and excessive manual review.
method End-to-end framework using equigrid bounding-box filter, CSR representation, neural ranker, and inverse-variance weighted ensemble of threshold estimators.
result Achieves exact recall with sub-percent variance over tens of millions of geometry pairs, runs on a single TPU v3 core.

Develops exact and invariant study-based decompositions for network meta-analysis.

problem Lack of exact contribution decompositions in network meta-analysis.
method Contrast-space projection formulation of NMA, study-based definition of direct and indirect evidence.
result Exact covariance-aware decompositions of NMA estimator into direct and indirect contributions.

Optimizes budgeted evaluations of LLMs by allocating queries to judges efficiently.

problem Evaluating LLMs with heterogeneous judges and varying costs and reliability.
method Formalizes and analyzes budgeted heteroskedastic multi-judge estimation, proposing EST-IVWE for practical implementation.
result EST-IVWE matches the oracle IVWE rate up to lower-order terms in the budget and is instance-optimal.

This paper studies robust regression in the settings of Huber's εε-contamination models. We consider estimators that are maximizers of multivariate regression depth functions. These estimators are shown to achieve minimax rates in the settings of εε-contamination models for various regression problems including nonpa…

2017-02-15abs ↗pdf ↗

This paper studies the nonparametric modal regression problem systematically from a statistical learning view. Originally motivated by pursuing a theoretical understanding of the maximum correntropy criterion based regression (MCCR), our study reveals that MCCR with a tending-to-zero scale parameter is essentially moda…

2017-02-20abs ↗pdf ↗

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.

This paper reviews SDR methods for multivariate response regression.

problem Handling sufficient dimension reduction for multivariate response regression.
method Characterizes SDR estimators as inverse or forward regression methods.
result Pooled marginal, projective resampling, distance-based, ordinary least squares, partial least squares, and semiparametric SDR estimators are discussed.

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.

Prevalidated ridge regression simplifies logistic regression for high-dimensional data.

problem Efficient probabilistic classification in high-dimensional data with logistic regression.
method Developed a prevalidated ridge regression model that matches logistic regression's performance but is more computationally efficient.
result Prevalidated ridge regression achieves similar classification error and log-loss to logistic regression for high-dimensional data.

We simplify complex regression coefficients using linearization and feature comparison.

problem Interpreting high-dimensional regression coefficients from nonlinear responses.
method Developed a linearization method to derive feature coefficients and compare them with regression coefficients.
result Shows how regression coefficients relate to linearized feature coefficients and how they change under regularization.

Unified framework for fair regression under demographic parity.

problem Ensuring fairness in regression tasks subject to demographic parity constraints.
method Proposes a unified framework applicable to various regression tasks with a broad spectrum of loss functions, derived a novel characterization of the fair risk minimizer, and established theoretical consistency and convergence rates.
result Effective minimization of risk while satisfying fairness constraints across various regression settings.

Locally adaptive interpretable regression improves linear regression's predictability.

problem Linear regression's predictability is limited; it lacks adaptability.
method Locally adaptive interpretable regression (LoAIR) uses neural networks to predict percentile of a Gaussian distribution for regression coefficients.
result LoAIR achieves comparable or better predictive performance than state-of-the-art baselines.

Huber regression assessed for robustness in statistical learning.

problem Understanding Huber regression in nonparametric statistical learning.
method Assessment from statistical learning perspective, focusing on risk consistency, adaptive tuning, and convergence rates.
result Huber regression can be asymptotically mean regression calibrated under (1+ε)(1+ε)-moment conditions, justifying its robustness.

Least Angle Regression is a promising technique for variable selection applications, offering a nice alternative to stepwise regression. It provides an explanation for the similar behavior of LASSO (1\ell_1-penalized regression) and forward stagewise regression, and provides a fast implementation of both. The idea has…

2008-02-07abs ↗pdf ↗

We analyze coresets for regularized regression problems and propose a modified lasso that yields smaller coresets.

problem Analyzing coresets for regularized regression problems.
method Examined coresets for ridge regression and proposed a modified lasso problem.
result No coreset for regularized regression can be smaller than the unregularized version when reqsr eq s.

Study uniform consistency in nonparametric mixture models and mixed regression.

problem Uniform consistency in nonparametric mixture models and mixed regression models.
method Construct uniformly consistent estimators under general conditions, develop novel technical tools.
result Prove uniform consistency results for nonparametric mixtures and mixed regression models.

Collider regression improves predictive performance in regression tasks.

problem Discarding prior causal knowledge in regression tasks.
method Collider regression framework incorporating probabilistic causal knowledge from collider structures.
result Proves positive generalization benefit and provides closed-form estimators.

We describe dimensionally constrained symbolic regression which has been developed for mass measurement in certain classes of events in high-energy physics (HEP). With symbolic regression, we can derive equations that are well known in HEP. However, in problems with large number of variables, we find that by constraini…

2011-06-20abs ↗pdf ↗