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

80161241321 · Jun 202019922001200920172026
48 results for joint error

Novel upper bound for unsupervised domain adaptation considers joint error.

problem Addressing the issue of mixing samples from different classes when matching marginal distributions.
method Proposes a general upper bound that penalizes undesirable joint error, uses constrained hypothesis space, and introduces cross margin discrepancy.
result Our proposal outperforms related approaches in image classification error rates on domain adaptation benchmarks.

Bayesian framework improves robustness in nonlinear regression models.

problem Measurement error, model misspecification, and distributional misspecification in regression analyses.
method Joint Dirichlet process prior on latent covariate-response distribution, updating with posterior pseudo-samples.
result Improved stability and consistency in estimators under increasing measurement error.

Estimates multiple linear systems on a graph with smoothness constraints.

problem Joint estimation of multiple linear systems under graph smoothness constraints.
method Proposes estimators for joint estimation of system matrices with error bounds.
result MSE converges to zero as mm increases, typically polynomially fast w.r.t mm.

Develops a framework to quantify uncertainties in multiple ML models.

problem Uncertainty in ML model predictions and model inputs.
method Develops a theoretical framework to decouple and transform uncertainties.
result Generates joint distribution of ML predictions considering uncertainties.

The paper tackles joint learning of linear systems, improving accuracy with pooled data.

problem Estimating transition matrices of multiple related linear systems more accurately.
method Developed novel techniques to bound estimation errors and establish high probability bounds for singular values.
result Significant gains in accuracy achieved by pooling data across systems.

We consider assets for which price XtX_t and squared volatility YtY_t are jointly driven by Heston joint stochastic differential equations (SDEs). When the parameters of these SDEs are estimated from NN sub-sampled data (XnT,YnT)(X_{nT}, Y_{nT}), estimation errors do impact the classical option pricing PDEs. We estimate thes…

2014-04-15abs ↗pdf ↗

This paper analyzes AJIVE for estimating shared subspace across multiple datasets, revealing its strengths and limitations.

problem Estimating shared subspace across multiple datasets with varying degrees of misalignment.
method Angle-based Joint and Individual Variation Explained (AJIVE) method, a two-stage spectral approach.
result AJIVE's performance in high signal-to-noise ratio (SNR) regimes and its non-diminishing error in low-SNR settings.

We consider the problem of approximate joint triangularization of a set of noisy jointly diagonalizable real matrices. Approximate joint triangularizers are commonly used in the estimation of the joint eigenstructure of a set of matrices, with applications in signal processing, linear algebra, and tensor decomposition.…

2016-07-02abs ↗pdf ↗

Mutually interacting components form complex systems and the outputs of these components are usually long-range cross-correlated. Using wavelet leaders, we propose a method of characterizing the joint multifractal nature of these long-range cross correlations, a method we call joint multifractal analysis based on wavel…

2016-11-03abs ↗pdf ↗

Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a method to jointly embed multiple undirected graphs. Given a set of graphs, the jo…

2017-03-10abs ↗pdf ↗

Estimates changes in parameters from sparse binomial observations.

problem Sparse observations of binomial parameters over a large population.
method Two-step procedure: MLE for joint distribution, then for change distribution and magnitude.
result Achieves optimal error bounds for estimating change distribution and magnitude.

Paper presents J-RFDL for robust DL in compressed space, improving data representation robustness and accuracy.

problem Improving data representation robustness and accuracy in the presence of noise and outliers.
method Joint Robust Factorization and Projective Dictionary Learning (J-RFDL) in a factorized compressed space.
result Delivers superior performance in data representation and classification over state-of-the-art methods.

Proposes HeteroJIVE for joint subspace estimation in multi-view data with statistical and structural heterogeneity.

problem Joint subspace estimation in multi-view data with varying statistical and structural heterogeneity.
method HeteroJIVE: A weighted two-stage spectral algorithm addressing statistical and structural heterogeneity.
result HeteroJIVE achieves the O(K1/2)O(K^{-1/2}) rate without iterative refinement, validating the oracle-optimal weighting scheme.

JANET improves time series prediction with adaptive uncertainty regions.

problem Time series data's lack of exchangeability and multi-step prediction challenges.
method Proposes JANET, a framework for joint adaptive prediction regions with controlled error rates.
result Demonstrates superior performance in multi-step prediction tasks across diverse datasets.

This work proposes a new method to estimate joint probability from pairwise marginals, reducing sample complexity.

problem Direct nonparametric estimation of high-dimensional joint probability is infeasible due to the curse of dimensionality.
method Developed a coupled nonnegative matrix factorization (CNMF) framework using only pairwise marginals.
result The method provably recovers the joint probability mass function up to bounded error in finite iterations under reasonable conditions.

The paper develops a framework for abstracting causal models using category theory.

problem Difficulties in changing the variables used to describe a system, especially from fine-grained to coarse-grained.
method Introduces a category of interventional causal models and uses enriched category theory to prove compositionality properties.
result Compositionality of model transformations is established, with bounded errors for each step.

Novel approach for estimating joint probability densities using tensor decompositions and dictionaries.

problem Estimating joint probability densities of mixed discrete and continuous variables.
method Low-rank tensor decomposition combined with dictionary learning.
result Better classification and lower error rates compared to existing methods.

FreST Loss decorrelates spatio-temporal dependencies in graph signals.

problem Complex spatio-temporal dependencies in graph-structured signals are not well captured by standard forecasting models.
method FreST Loss extends supervision to the joint spatio-temporal spectrum using Joint Fourier Transform (JFT).
result FreST Loss reduces estimation bias and improves forecasting accuracy on real-world datasets.

This paper improves speech recognition by distilling knowledge from acoustic models.

problem Improving speech recognition accuracy using ensemble models.
method Proposes multi-teacher distillation strategies for joint CTC-attention end-to-end ASR systems, integrating error rate metric for optimization.
result Reports state-of-the-art error rates on various datasets and languages.

Estimates parameters of interconnected linear systems using total variation penalization.

problem Joint estimation of parameters in interconnected linear dynamical systems.
method Total variation penalized least-squares estimator.
result The MSE goes to zero as the number of systems increases, even with constant trajectory length.

In math.GT/0002110 the author's Theorems 1.1 and 1.2, combined, implied that iterated torus knots are transversally simple. This result is in error and this erratum pin points the error. In "An addendum on iterated torus knots" a more subtle result is proven resulting in giving a geometric realization of the Honda-Etny…

2006-10-18abs ↗pdf ↗

Proposes a regularization method for unsupervised domain adaptation that aligns predictions with target data's top singular vectors.

problem Domain adaptation challenges in high joint error scenarios.
method Regularizes classifier to align with unsupervised target data guided by label alignment property (LAP).
result The method improves performance in MNIST-USPS domain adaptation and cross-lingual sentiment analysis.

We present a new method for high-dimensional linear regression when a scale parameter of the additive errors is unknown. The proposed estimator is based on a penalized Huber MM-estimator, for which theoretical results on estimation error have recently been proposed in high-dimensional statistics literature. However, t…

2018-11-06abs ↗pdf ↗

Sharp bounds on uniform generalization errors in binary linear classification.

problem Understanding the uniform generalization errors in binary linear classification.
method Isoperimetric arguments, Poincaré and log-Sobolev inequalities for joint distributions.
result Sharp concentration bounds on uniform generalization errors, almost sure convergence in broad settings.

An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Nevertheless, though state-of-the-art graph-based methods have been successful for many learning tasks, they do not consider time-evolving sig…

2016-07-12abs ↗pdf ↗

Due to the ability of deep neural nets to learn rich representations, recent advances in unsupervised domain adaptation have focused on learning domain-invariant features that achieve a small error on the source domain. The hope is that the learnt representation, together with the hypothesis learnt from the source doma…

2019-01-27abs ↗pdf ↗

This paper presents a Bayesian method for estimating the rank of a low-rank tensor model of joint PMF.

problem Estimating the rank of a low-rank tensor model of joint PMF from observed data.
method Bayesian framework for estimating low-rank components and rank simultaneously, using variational inference.
result Automatic rank detection and improved estimation accuracy compared to cross-validation methods.

Improved Q-learning for multi-agent reinforcement learning by weighting joint action values.

problem QMIX restricts QQ-values to monotonic mixtures, limiting complex value functions.
method Introduced weighted projection to recover optimal policies, improving performance.
result CW QMIX and OW QMIX outperform baseline QMIX on multi-agent tasks.

Proposes a Structural Matrix Autoregressive model for joint analysis of asset returns, realized volatility, and trading volume.

problem Joint analysis of asset returns, realized volatility, and trading volume
method Structural Matrix Autoregressive model
result Volatility is primary driver of trading activity, with informational shocks incorporated through price variability.

Paper proposes a method to maintain ASR performance on new tasks without forgetting old ones.

problem Mitigating forgetting in ASR models when learning new tasks.
method A novel explainability-based knowledge distillation combined with response-based knowledge distillation.
result Our method outperforms existing ones in mitigating forgetting on multi-stage sequential training tasks.

Any two compact, complete, one-dimensional geodesic spaces with identical marked length spectrum have isometric π1π_1-hull. The present version contains errors, notably in Lemmas 2.2 and 2.3 (path cancellations can be more complicated), which then propagate through the paper. The main result is correct as stated, and a…

2003-01-26abs ↗pdf ↗

DSL estimates heterogeneous treatment effects over time in survival settings.

problem Complicated by right censoring and time-varying treatment effects.
method Deep survival learner (DSL) for estimating CATEs over a clinically relevant time spectrum.
result DSL reveals heterogeneity in perioperative chemotherapy effects over time.

The paper proposes a method to construct well-calibrated prediction sets for correlated target variables.

problem Constructing well-calibrated prediction sets for correlated target variables.
method The method uses vine copulas to estimate the joint cumulative distribution function of non-conformity scores and improves the asymptotic efficiency of the quantile estimate.
result The method guarantees asymptotically exact coverage and competitive efficiency on real-world regression problems.

New algorithms for private generalized linear contextual bandits.

problem Private estimation and optimization for generalized linear models under differential privacy.
method Developed algorithms for stochastic and adversarial contexts under shuffle and joint differential privacy.
result Achieved private regret bounds for generalized linear models, differing from non-private rates by factors of d/ε\sqrt{d/\varepsilon} and d/ε\sqrt{d/\varepsilon} respectively.

Calibrated probabilistic solvers improve accuracy of ODE estimates.

problem Uncertainty in probabilistic ODE solutions is not well-calibrated for adaptive step sizes.
method Introduce and assess several calibration methods for probabilistic ODE solvers.
result Calibration methods interact efficiently with adaptive step-size selection, improving posteriors.

Study tests adequacy of FARIMA models with uncorrelated but non-independent errors.

problem Testing adequacy of FARIMA models with specific error characteristics.
method Derive asymptotic distributions of residual autocovariances and autocorrelations, propose self-normalization approach.
result Asymptotic distributions of modified portmanteau statistics for weak FARIMA models.

While it's always possible to compute a variational approximation to a posterior distribution, it can be difficult to discover problems with this approximation. We propose two diagnostic algorithms to alleviate this problem. The Pareto-smoothed importance sampling (PSIS) diagnostic gives a goodness of fit measurement f…

2018-02-07abs ↗pdf ↗