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

179358537716 · Jun 202019922001200920172026
48 results for dependence estimation

Estimates binary labels from dependent data using Markov Random Fields.

problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.

Estimating the dependency of variables is a fundamental task in data analysis. Identifying the relevant attributes in databases leads to better data understanding and also improves the performance of learning algorithms, both in terms of runtime and quality. In data streams, dependency monitoring provides key insights …

2018-10-04abs ↗pdf ↗

New methods estimate point-wise dependency from neural MI models.

problem Estimating point-wise dependency between different events.
method Developed two methods: Probabilistic Classifier and Density-Ratio Fitting.
result Demonstrated effectiveness in MI estimation, self-supervised representation learning, and cross-modal retrieval.

Paper improves signal proportion estimation by accounting for variable dependence.

problem Traditional estimators assume independence, limiting applicability in real-world scenarios.
method Integrates arbitrary covariance dependence information using principal factor approximation.
result Method outperforms state-of-the-art estimators in accuracy and detection of weaker signals.

Sparse-penalized deep neural networks improve performance in weakly dependent processes.

problem Nonparametric regression and classification under weak dependence.
method Sparse-penalized deep neural networks with oracle inequalities and convergence rates established.
result The proposed estimators outperform non-penalized ones in simulations.

Estimating the strength of dependency between two variables is fundamental for exploratory analysis and many other applications in data mining. For example: non-linear dependencies between two continuous variables can be explored with the Maximal Information Coefficient (MIC); and categorical variables that are depende…

2015-10-27abs ↗pdf ↗

New method uses Winsorized mean estimators for privacy-preserving statistics on dependent data.

problem Privacy-preserving statistics on dependent data with sensitive information.
method Adapting noisy Winsorized mean estimators to handle dependence via log-Sobolev inequalities.
result Asymptotic and finite sample guarantees for item-level and user-level mean estimation similar to \iid{} settings.

Estimates dependent parameters using Markovian dependence with shrinkage.

problem Estimating dependent parameters from a hidden Markov model.
method Developed a novel non-parametric shrinkage algorithm combining Tweedie-based ideas and efficient state estimation.
result Superior performance compared to non-shrinkage methods in hidden Markov models.

Deep neural nets can estimate regression with dependent data without the curse of dimensionality.

problem Regression with dependent data and structural assumptions on the regression function.
method Deep recurrent neural network estimate under suitable structural assumptions.
result Deep neural nets can circumvent the curse of dimensionality for regression with dependent data.

The paper proposes estimators for bid-ask spreads with and without serial dependence.

problem Estimating bid-ask spreads in financial markets with and without serial dependence.
method The authors propose moment-based estimators for bid-ask spreads, considering both geometric Brownian motion and geometric fractional Brownian motion for price dynamics, and Ornstein-Uhlenbeck process for microstructure noise.
result The estimators are consistent and asymptotically normal, and perform well compared to existing approaches on simulated data.

The paper explains why estimating a history-dependent policy can reduce MSE in reinforcement learning.

problem Understanding why history-dependent policies can improve MSE in off-policy evaluation.
method The paper derives a bias-variance decomposition of MSE for various OPE estimators, showing how history-dependent policies can decrease variance and increase bias.
result History-dependent policies can decrease the variance of importance sampling estimators, leading to lower MSE.

Paper proposes a new DR estimator for adaptive experiments with improved performance.

problem Improving policy evaluation in adaptive experiments with dependent samples.
method Adaptive-fitting variant of sample-splitting for non-Donsker nuisance estimators.
result Proposed DR estimator shows better performance than other estimators with dependent samples.

Estimates change points in Weibull time series with copulas.

problem Change-point estimation for nonlinear Weibull time series with copula-based Markov models.
method Copula-based Markov chain model with Weibull marginal distributions, incorporating asymmetric dependence structures through Clayton and Joe copulas.
result Proposed method performs well in estimating change points and model parameters, demonstrated through extensive numerical studies and empirical application.

This paper proposes a geometric estimator of dependency between a pair of multivariate samples. The proposed estimator of dependency is based on a randomly permuted geometric graph (the minimal spanning tree) over the two multivariate samples. This estimator converges to a quantity that we call the geometric mutual inf…

2019-05-21abs ↗pdf ↗

InfoAtlas speeds up MI estimation for real-time data analysis.

problem Efficiently measuring statistical dependency between high-dimensional datasets.
method Directly infers mutual information in a single forward pass using a pretrained model.
result Matches state-of-the-art accuracy with 100x speedup.

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.

Deep learning estimates time-varying Markov model parameters.

problem Estimating time-dependent parameters in Markov models.
method Reframes parameter estimation as an optimization problem using maximum likelihood.
result Real solution close to SDE with neural network-derived parameters under specific conditions.

Neural Bayes methods simplify fitting complex bivariate extremal models.

problem Inference on complex multivariate extremal dependence models with computationally expensive likelihood functions.
method Use neural networks to approximate Bayes estimators and classifiers for model selection.
result Proposed neural Bayes methods enable routine implementation of complex extreme-value dependence models.

We propose a new multivariate dependency measure. It is obtained by considering a Gaussian kernel based distance between the copula transform of the given d-dimensional distribution and the uniform copula and then appropriately normalizing it. The resulting measure is shown to satisfy a number of desirable properties. …

2017-08-24abs ↗pdf ↗

Study uses deep neural networks for inference in partially linear models with dependent data.

problem Inference in partially linear models with dependent data.
method First stage deep neural network (DNN) estimation followed by n\sqrt{n}-consistent and asymptotically normal estimator.
result The DNN-estimated finite dimensional parameter achieves n\sqrt{n}-consistency and asymptotic normality.

Efficient neural Bayes estimators for censored peaks-over-threshold models improve inference speed and accuracy.

problem Computational burden in inference with spatial extremal dependence models due to intractable or censored likelihoods.
method Developed neural Bayes estimators using data augmentation techniques to encode censoring information.
result Significant gains in computational and statistical efficiency compared to traditional methods.

Paper uses VAEAC to estimate Shapley values for complex models with mixed features.

problem Estimating Shapley values for models with dependent mixed features.
method Uses variational autoencoder with arbitrary conditioning (VAEAC) to model feature dependencies.
result VAEAC approach outperforms state-of-the-art methods for various settings.

Develops black-box methods to estimate parameters of complex models.

problem Lack of efficient methods to produce simulations for complex statistical models.
method Pre-training deep neural networks on extensive simulated databases for well-structured likelihoods. Iterative algorithm for other complex dependencies.
result Successfully estimates and quantifies uncertainty of parameters from non-Gaussian models.

New algorithm achieves data-dependent regret bounds in MDPs with unknown transitions.

problem Achieving best-of-both-worlds guarantees with data-dependent regret bounds in MDPs with unknown transitions.
method Optimistic follow-the-regularized-leader algorithm with new optimistic Q-function estimators and transition bonus.
result First-order, second-order, and path-length bounds with polylog(T) regret in the stochastic regime.

Paper analyzes deep neural networks with dependent data, establishing convergence rates and error bounds.

problem Statistical analysis of deep neural networks under dependent data.
method Establishes rates of convergence and L2\mathcal{L}^{2}-error bounds for nonparametric sieve estimators of DNNs.
result Non-asymptotic probability bounds on L2\mathcal{L}^{2}-errors for DNN estimators under stationary β\beta-mixing data.

Neural network method estimates covariate-dependent graphical models with statistical guarantees.

problem Estimating graph structure from covariate-dependent data.
method Neural network approach that allows flexible functional dependency on covariates.
result Theoretical PAC guarantees for the method's performance.

Study heat flow on changing surfaces, proving existence and uniqueness.

problem Existence and uniqueness of heat flow on time-varying manifolds.
method Establishes estimates for heat flow under minimal assumptions, focusing on logarithmic derivative of volume measure.
result Proves estimates hold for Ricci flow with scalar curvature bounded below, dependent only on initial data.

Develops inequalities for high-dimensional linear processes with dependent innovations.

problem Estimating high-dimensional VAR(p) systems and HAC covariance estimation.
method Concentration inequalities for ll_\infty norm of vector linear processes with sub-Weibull, mixingale innovations.
result Obtained concentration bounds for the maximum entrywise norm of lag-hh autocovariance matrices.