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

Trend · papers per month

125249374498 · May 202619922001200920172026
48 results for local dependence

This study examines local co-movements in energy, agriculture, and metal markets using copulas.

problem Identifying local dependencies and asymmetries in energy, agriculture, and metal markets.
method Non-parametric mixture copula and copula-based local Kendall's tau approach.
result Increased co-movements in extreme situations, asymmetric local dependence, and diversification potential.

LOV model calibrates European and American options with path-dependent volatility.

problem Calibrating European and American options with path-dependent volatility.
method Designing a local volatility model that incorporates path-dependent shocks through an occupation sensitivity function.
result LOV model successfully calibrates options chains with automatic European vanilla option calibration and path-dependent flexibility.

Study of SGD with state-dependent noise, improving escape from local minima.

problem Understanding and improving the dynamics of SGD in non-convex optimization.
method Formal study on SGD with state-dependent noise, proposing power-law dynamic with state-dependent diffusion.
result Power-law dynamic can escape from sharp minima exponentially faster than flat minima.

Local Gaussian correlation struggles in tails but a new method improves it.

problem Local Gaussian correlation's limitations in tail dependence.
method A new adaptive bandwidth method for LGC, optimizing for local effective sample size.
result Adaptive bandwidths outperform global ones in moderate dependence, but not in strong or weak dependence.

Paper studies CLT rates for dependent data in Wasserstein-p distance.

problem CLT rates for multivariate dependent data in Wasserstein-p distance.
method Analyzes locally dependent sequences and geometrically ergodic Markov chains.
result Establishes optimal W1W_1 CLT rates and WpW_p (p2p\ge 2) rates for dependent data.

New method aggregates Gaussian experts by detecting conditional independence violations.

problem Aggregation of dependent Gaussian experts leads to sub-optimal solutions.
method Uses Gaussian graphical model to detect and correct conditional independence violations.
result Improves aggregation of Gaussian experts, outperforming SOTA DGP approaches.

Study problem-dependent rates in statistical learning theory, achieving optimal generalization error bounds.

problem Generalization error in statistical learning theory.
method Uniform localized convergence framework.
result Optimal generalization error bounds for various learning problems.

Attention mechanism is a hot spot in deep learning field. Using channel attention model is an effective method for improving the performance of the convolutional neural network. Squeeze-and-Excitation block takes advantage of the channel dependence, selectively emphasizing the important channels and compressing the rel…

2019-01-06abs ↗pdf ↗

We formulate simple assumptions, implying the Robbins-Monro conditions for the QQ-learning algorithm with the local learning rate, depending on the number of visits of a particular state-action pair (local clock) and the number of iteration (global clock). It is assumed that the Markov decision process is communicatin…

2018-08-01abs ↗pdf ↗

In many applications, data come with a natural ordering. This ordering can often induce local dependence among nearby variables. However, in complex data, the width of this dependence may vary, making simple assumptions such as a constant neighborhood size unrealistic. We propose a framework for learning this local dep…

2016-04-25abs ↗pdf ↗

In this work we prove the fact that, for a short time, it is possible to construct a smooth parametrized family of isometric embeddings of an arbitrary smooth parametrized family of Riemannian metrics on a smooth closed manifold into an Euclidean space. In order to prove this statement we work out stability estimates w…

2017-12-07abs ↗pdf ↗

Paper proposes an active learning method for surgical workflow recognition using long-range temporal dependency.

problem Challenges in automatic surgical workflow recognition due to lack of large-scale labelled datasets.
method NL-RCNet with non-local block for capturing long-range temporal dependency and intra-clip dependency score for selection.
result Our approach outperforms state-of-the-art methods by selecting only 50% of samples for training.

This study uses local Gaussian correlation to analyze stock return tails, revealing more sensitive network properties.

problem Misleading results from Pearson correlation in financial networks.
method Local Gaussian correlation coefficient for capturing nonlinear dependence and heavy-tailed distributions.
result Local Gaussian correlation network among negative tails is more sensitive to stock market risks.

Develops a new exponential map for time-varying vector fields.

problem Lack of global flows for general time-varying vector fields.
method Categorical development of spaces of vector fields and flows, allowing for systematic localisation.
result Derives the homeomorphism of the exponential map for vector fields with measurable time-dependence.

CaLoNet integrates spatial and local correlations for multivariate time series classification.

problem Ignoring spatial and local correlations in multivariate time series classification.
method Model spatial correlations using causality modeling, extract local correlations, integrate into graph neural network.
result Competitive performance compared to state-of-the-art methods on UEA datasets.

Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models. We propose Mahé, a novel approach to provide Model-agnostic hierarchical éxplanations of how powerful machine learning models, such as deep ne…

2018-12-12abs ↗pdf ↗

Unified view of federated learning and distributed RL using local stochastic approximation.

problem Finding the root of an operator composed of local operators in a network of agents with dependent data.
method Local stochastic approximation over a network of agents with Markov process-dependent data.
result Convergence rates of local stochastic approximation for both constant and time-varying step sizes, within a logarithmic factor of independent data.

The study examines how weight sharing, equivariance, and locality affect the sample complexity of neural networks.

problem Understanding the impact of design choices on the generalization error of neural networks.
method Statistical learning theory applied to single hidden layer networks with weight sharing, equivariance, and locality.
result Lower and upper bounds for sample complexity are derived, showing that locality has benefits but comes with a trade-off.

This paper analyzes a simplified strategy for nonlinear control using local linear models and iLQR updates.

problem Nonlinear policy optimization in control systems.
method Iterative estimation of local linear models and iLQR-like policy updates.
result Demonstrates polynomial sample complexity and overcomes exponential problem horizon dependence.

A method to select important experts for Gaussian processes to balance computational efficiency and uncertainty quantification.

problem Balancing computational efficiency and uncertainty quantification in Gaussian processes for big data.
method Using graphical models to select important experts and aggregate their predictions while ensuring uncertainty quantification.
result Substantially reduces computational cost of aggregating dependent experts while ensuring calibrated uncertainty quantification.

Many nonparametric regressors were recently shown to converge at rates that depend only on the intrinsic dimension of data. These regressors thus escape the curse of dimension when high-dimensional data has low intrinsic dimension (e.g. a manifold). We show that k-NN regression is also adaptive to intrinsic dimension. …

2011-10-19abs ↗pdf ↗

We study the dependence structure of market states by estimating empirical pairwise copulas of daily stock returns. We consider both original returns, which exhibit time-varying trends and volatilities, as well as locally normalized ones, where the non-stationarity has been removed. The empirical pairwise copula for ea…

2015-03-31abs ↗pdf ↗

GADGET framework decomposes global feature effects using recursive partitioning.

problem Misleading global feature effects when feature interactions are present.
method Generalized additive decomposition of global effects (GADGET) based on recursive partitioning.
result Minimizes interaction-related heterogeneity of local feature effects.

MULTIFIT tests independence between two random vectors using multiscale Fisher's test.

problem Detecting local dependence between two random vectors.
method MULTIFIT uses a resampling-free approach to test independence.
result MULTIFIT can easily handle large sample sizes and interpret dependency nature.

We give a direct, explicit and self-contained construction of a local Lie groupoid integrating a given Lie algebroid which only depends on the choice of a spray vector field lifting the underlying anchor map. This construction leads to a complete account of local Lie theory and, in particular, to a finite-dimensional p…

2017-03-13abs ↗pdf ↗

Localized curvature bounds ensure harmonic maps are constant.

problem Ensuring harmonic maps are constant under localized curvature constraints.
method Localized Bochner-type rigidity theorem for harmonic maps with image-dependent curvature bounds.
result Harmonic maps are constant if minimal Ricci curvature dominates image-dependent curvature bounds.

Gibbs-ERM learning is a natural idealized model of learning with stochastic optimization algorithms (such as Stochastic Gradient Langevin Dynamics and ---to some extent--- Stochastic Gradient Descent), while it also arises in other contexts, including PAC-Bayesian theory, and sampling mechanisms. In this work we study …

2019-02-05abs ↗pdf ↗

Understanding and developing a correlation measure that can detect general dependencies is not only imperative to statistics and machine learning, but also crucial to general scientific discovery in the big data age. In this paper, we establish a new framework that generalizes distance correlation --- a correlation mea…

2017-10-26abs ↗pdf ↗

New method estimates high-dimensional GoM models efficiently.

problem Estimating GoM models for high-dimensional polytomous data.
method Flattening three-way quasi-tensor into a matrix, performing singular value decomposition.
result Established finite-sample error bounds for estimated parameters.