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

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for expected conditional covariance

This paper rethinks confidence calibration under covariate shifts.

problem Calibration methods struggle with covariate shifts and unstable importance weighting.
method Derives Expectation consistency condition and proposes Expectation consistency loss (ECL).
result ECL loss is compatible with various types of calibration and has the same sample complexity as ECE.

Under covariate shift, training (source) data and testing (target) data differ in input space distribution, but share the same conditional label distribution. This poses a challenging machine learning task. Robust Bias-Aware (RBA) prediction provides the conditional label distribution that is robust to the worstcase lo…

2017-12-28abs ↗pdf ↗

The paper calculates moments and conditional risks for skewed elliptical distributions.

problem Estimating moments and tail conditional risks for skewed elliptical distributions.
method Derives explicit expressions for multivariate doubly truncated moments and conditional risks for generalized skew-elliptical distributions.
result Explicit formulas for multivariate doubly truncated moments and conditional risks are derived for various skewed elliptical distributions.

The asymptotic distribution of the Markowitz portfolio is derived, for the general case (assuming fourth moments of returns exist), and for the case of multivariate normal returns. The derivation allows for inference which is robust to heteroskedasticity and autocorrelation of moments up to order four. As a side effect…

2013-12-02abs ↗pdf ↗

The paper introduces Shapley curves for measuring variable importance in nonparametric settings.

problem Limited statistical understanding of Shapley values as variable importance measures.
method Introduces Shapley curves based on conditional expectation and covariate distribution; derives convergence rates and normality; proposes a novel bootstrap procedure.
result Validates theoretical findings with numerical studies and analyzes vehicle prices determinants.

We propose a simple imputation method for high-dimensional linear regression with missing data.

problem Handling missing covariates in high-dimensional linear regression.
method Impute missing entries with conditional mean of observed covariates and use standard LASSO or square-root LASSO.
result The imputation scheme retains minimax estimation rate and is pivotal for the square-root LASSO.

Investigates portfolio optimization with and without gearing constraints.

problem Improving portfolio weights for better alignment with expected returns.
method Extends the alpha-weight angle bound to include gearing constraints and uses theoretical arguments and simulations.
result Equally weighted portfolios are not preferable to mean-variance portfolios even with poor forecast ability and a badly conditioned covariance matrix.

BEGIN network models binary data without parametric assumptions.

problem Conditional independence in non-parametric families of binary data.
method BEGIN network models binary data using sparse linear representations and block factorizations.
result BEGIN network captures conditional independence for arbitrary binary and multinomial variables.

Improved estimators for causal inference using cross-fitting and undersmoothing.

problem Estimating expected conditional covariance in causal inference.
method Double cross-fit doubly robust (DCDR) estimators with undersmoothing for non-smooth nuisance functions.
result DCDR estimators achieve n\sqrt{n}-consistency and asymptotic normality under minimal conditions.

Paper tackles backwards-compatible data adaptation for confounded covariate and label shifts.

problem Adapt covariates to predict labels confounded with covariate shifts.
method Proposes confounded shift framework based on minimizing divergence between source and target conditional distributions, conditioning on confounders.
result Demonstrates approach on synthetic and real datasets, achieving backwards-compatible data adaptation.

This study evaluates shrinkage estimators for improving mean and covariance in portfolio optimization.

problem Estimation errors in expected returns and covariance matrix in mean-variance model.
method Examined five shrinkage estimators for expected returns and eleven for covariance matrix across six datasets.
result GMV model with Ledoit Wolf COV2 outperforms traditional methods in most scenarios.

Gaussian Processes offer a flexible method for modeling and predicting outcomes with uncertainty estimates.

problem Capturing uncertainty in predictions at new data points, especially with poor overlap and extrapolation.
method Gaussian Processes model a posterior distribution over outcomes, reflecting the range of plausible models.
result GPs provide a principled approach to handling extrapolation and uncertainty in predictions.

Regularized EM algorithm improves clustering performance with small sample sizes.

problem Performance reduction in EM algorithm due to small sample size and poorly conditioned covariance matrices.
method Regularized EM algorithm that uses prior knowledge to ensure positive definiteness of covariance matrices.
result The regularized EM algorithm outperforms standard EM in clustering tasks with small sample sizes.

The paper addresses portfolio allocation with uncertain covariance matrices, finding a logarithmic risk dependence.

problem Portfolio allocation with uncertain covariance matrices.
method Calculates the expected value of CARA utility function over a distribution of covariance matrices, considering uncertainty in future returns and covariances.
result Marginalization introduces a logarithmic dependence on risk, leading to lower allocation levels for higher uncertainties.

We analyze the size of the dictionary constructed from online kernel sparsification, using a novel formula that expresses the expected determinant of the kernel Gram matrix in terms of the eigenvalues of the covariance operator. Using this formula, we are able to connect the cardinality of the dictionary with the eigen…

2012-06-18abs ↗pdf ↗

Exact minimax risk derived for linear prediction with sample covariance analysis.

problem Understanding the minimax risk in linear prediction under various covariate distributions.
method Exact minimax risk analysis, leveraging statistical leverage scores and PAC-Bayes techniques.
result The minimax risk is of order d/(nd+1)d/(n-d+1) for any covariate distribution, nearly matching the risk for Gaussian design.

Signals coming from multivariate higher order conditional moments as well as the information contained in exogenous covariates, can be effectively exploited by rational investors to allocate their wealth among different risky investment opportunities. This paper proposes a new flexible dynamic copula model being able t…

2016-01-20abs ↗pdf ↗

Study robust linear regression without distributional assumptions for heavy-tailed responses.

problem Linear regression with heavy-tailed responses and no distributional assumptions.
method Combining truncated least squares, median-of-means, and aggregation theory to construct a non-linear estimator.
result Achieves excess risk of order d/nd/n with optimal sub-exponential tail.

Study integrates machine learning with SAA for optimizing decisions based on uncertain parameters and covariates.

problem Optimizing decisions under uncertain parameters and covariates.
method Data-driven frameworks integrating machine learning prediction models within SAA for scenario generation.
result Consistent and asymptotically optimal solutions under certain conditions, with finite sample guarantees.

Bayesian approach models match and non-match score distributions over continuous covariates.

problem Complex evaluation of model performance over continuous covariates in biometric verification.
method Generative model of score distributions, mixture models, local basis functions, Bayesian inference.
result Accurate and effective method for studying model performance over continuous covariates.

In this paper, we consider the Graphical Lasso (GL), a popular optimization problem for learning the sparse representations of high-dimensional datasets, which is well-known to be computationally expensive for large-scale problems. Recently, we have shown that the sparsity pattern of the optimal solution of GL is equiv…

2017-11-24abs ↗pdf ↗

Study on critical points in random neural networks, revealing three regimes based on activation function.

problem Investigating the expected number of critical points in random neural networks.
method Deriving asymptotic formulas for critical points under infinite-width limit and suitable regularity conditions.
result Three distinct regimes of critical points behavior depending on activation function.

Regularized EM algorithm improves GMM clustering in low sample settings.

problem Numerical instability and convergence issues in EM-GMM for low sample support.
method Regularized EM algorithm that maximizes penalized GMM likelihood, ensuring positive definiteness and structured covariance matrices.
result The regularized EM algorithm leads to better performing EM for structured covariance matrix models or low sample settings.

Paper addresses off-policy evaluation and learning with covariate shift.

problem Evaluating and training a new policy using historical data with a covariate shift.
method Derives efficiency bounds and proposes doubly robust estimators for OPE and OPL under covariate shift.
result Proposes estimators for off-policy evaluation and learning under covariate shift.

The paper proves asymptotic normality for multinomial logistic regression on null covariates.

problem Classical asymptotic normality results fail in high-dimensional multinomial logistic models.
method Developed asymptotic normality and chi-square results for multinomial logistic MLE on null covariates.
result Validated new methodology to test feature significance in high-dimensional classification problems.

Deep learning improves causal effect estimation from complex observational data.

problem Estimating causal effects from complex observational data with low bias.
method Unified deep learning framework using multitask recurrent neural networks.
result Deep learning estimator shows lower bias in causal effect estimates.

Method minimizes total cost of classification by acquiring covariates efficiently.

problem Minimizing total cost of classification in applications with covariate acquisition costs.
method Formalizes optimization goal using Bayes risk, introduces assumptions for computable solution.
result Proposed method achieves lowest total costs compared to previous methods on medical datasets.

Deep neural networks improve portfolio construction by jointly modeling returns and risks.

problem Traditional portfolio construction methods fail under time-varying market conditions.
method Jointly modeling dynamic expected returns and risk structures using deep neural networks.
result Deep forecasting model achieves competitive predictive accuracy and economically meaningful directional accuracy.

Defines a new metric to measure importance of predictors in complex machine learning models.

problem Measuring importance of predictors in black box machine learning models.
method Introduces a new metric, GVIM, based on true conditional expectation functions and causal interpretation.
result The GVIM can be represented as a function of Conditional Average Treatment Effect (CATE), providing a causal interpretation.

New framework for conditional risk minimization using optimal transport.

problem High-stakes decisions with side information, especially economic conditions.
method Universal framework based on union-ball formulation in optimal transport.
result Offers interpretability, tractability, and scalability for various risk functionals.

Machine learning improves trial analysis precision by adjusting for prognostic variables.

problem Improving precision in randomized trial analyses using covariate adjustment.
method Targeted machine learning estimation (TMLE) with adaptive pre-specification.
result Maximized empirical efficiency through cross-validated variance minimization.

This paper revisits the Bayesian CMA-ES and provides updates for normal Wishart. It emphasizes the difference between a normal and normal inverse Wishart prior. After some computation, we prove that the only difference relies surprisingly in the expected covariance. We prove that the expected covariance should be lower…

2019-04-02abs ↗pdf ↗

Efficiently solves large portfolio optimization problems by reducing and sparsifying covariance matrices.

problem Large and dense covariance matrices limit efficient portfolio optimization.
method Dimension reduction and increased sparsity based on machine learning predictions.
result Improved portfolio performance and reduced runtime compared to full dense covariance matrices.

Personalized pricing analytics is becoming an essential tool in retailing. Upon observing the personalized information of each arriving customer, the firm needs to set a price accordingly based on the covariates such as income, education background, past purchasing history to extract more revenue. For new entrants of t…

2018-05-03abs ↗pdf ↗

This paper proposes a new algorithm for Gaussian process classification based on posterior linearisation (PL). In PL, a Gaussian approximation to the posterior density is obtained iteratively using the best possible linearisation of the conditional mean of the labels and accounting for the linearisation error. PL has s…

2018-09-13abs ↗pdf ↗

Estimates treatment effect using ratio of potential outcomes in MS patients.

problem Estimating treatment-covariate interactions in observational studies.
method Proposes a doubly robust estimator for the ratio of expected potential outcomes.
result Validates the proposed estimator on an independent sample.

Paper tackles domain generalization by minimizing domain-based covariance.

problem Training data and test data have different distributions, leading to poor generalization.
method Find a central subspace minimizing domain-based covariance while preserving functional relationships.
result The proposed method achieves better generalization performance on unseen test datasets.