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

105210315420 · May 202619922001200920172026
48 results for global dependencies

A new deep generative model captures global dependencies without supervision.

problem Global modeling in deep generative models.
method Non-i.i.d. variational autoencoders with mixture model and global Gaussian latent variable.
result Captures interpretable disentangled representations and domain alignment.

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.

New algorithms improve privacy in bandit problems with partial information.

problem Privacy constraints in multi-armed bandit problems with partial reward information.
method Proposed a generic framework for designing εε-global DP extensions of UCB and KL-UCB algorithms.
result AdaP-KLUCB algorithm achieves optimal regret bound under εε-global DP constraints.

The study examines tail dependence between global economic uncertainty and BRICS currencies using high-frequency data.

problem Understanding the tail dependence between exchange rates and economic uncertainty.
method Daily Twitter Uncertainty Index and BRICS exchange rates analyzed using time-varying copula framework.
result Indian, Russian, and South African currencies exhibit elliptical copulas, while Brazilian and Chinese currencies show upward trending tail dependence.

TADA detects anomalies in time series using topological data analysis.

problem Detecting global changes in dependency structure between channels in multivariate time series.
method Topological Data Analysis for detecting anomalies in multivariate time series.
result The approach is more suitable for detecting global changes of correlation structures than existing methods.

Study robustness of global feature effect explanations in machine learning models.

problem Vulnerability of global feature effect explanations to data and model perturbations.
method Theoretical bounds and experimental evaluation of partial dependence plots and accumulated local effects.
result Quantifies the gap between best and worst-case scenarios of misinterpreting machine learning predictions globally.

Proves global well-posedness for superquadratic BSDEs without Markovian assumption.

problem Global well-posedness of multidimensional superquadratic BSDEs without Markovian assumption.
method Interplay between local well-posedness of FBSDEs and backward iterations of superquadratic BSDEs.
result Global well-posedness of superquadratic BSDEs proved.

The global financial system is highly complex, with cross-border interconnections and interdependencies. In this highly interconnected environment, local financial shocks and events can be easily amplified and turned into global events. This paper analyzes the dependencies among nearly 4,000 stocks from 15 countries. T…

2017-04-04abs ↗pdf ↗

We consider derivative-free black-box global optimization of expensive noisy functions, when most of the randomness in the objective is produced by a few influential scalar random inputs. We present a new Bayesian global optimization algorithm, called Stratified Bayesian Optimization (SBO), which uses this strong depen…

2016-02-07abs ↗pdf ↗

New algorithm ensures global convergence in deep neural networks beyond NTK regime.

problem Existing global convergence guarantees do not apply to practical deep networks.
method Proposes an algorithm with global convergence guarantees under the expressivity condition.
result Algorithm ensures global convergence in practical settings beyond NTK regime.

LGnet jointly models local and global dynamics for MTS forecasting with missing values.

problem Missing values in multivariate time series data.
method LGnet framework using memory network and adversarial training.
result LGnet effectively forecasts MTS with missing values and robust under various missing ratios.

Quantifying the importance and power of individual nodes depending on their position in socio-economic networks constitutes a problem across a variety of applications. Examples include the reach of individuals in (online) social networks, the importance of individual banks or loans in financial networks, the relevance …

2019-06-14abs ↗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 ↗

Global sensitivity analysis with variance-based measures suffers from several theoretical and practical limitations, since they focus only on the variance of the output and handle multivariate variables in a limited way. In this paper, we introduce a new class of sensitivity indices based on dependence measures which o…

2013-11-11abs ↗pdf ↗

New algorithms reduce regret in online MDPs by adapting to data and variance.

problem Adapting to both adversarial and stochastic environments in online MDPs.
method Develops algorithms based on global optimization and policy optimization, using optimistic follow-the-regularized-leader with log-barrier regularization.
result Achieves refined data-dependent and variance-dependent regret bounds.

Researchers tackle the globalization problem of locally cosymplectic Hamiltonian dynamics.

problem Globalization problem of locally cosymplectic Hamiltonian dynamics.
method Investigate the geometry of locally conformally cosymplectic manifolds and provide a geometric Hamilton-Jacobi theory.
result Provide a geometric Hamilton-Jacobi theory on locally conformally cosymplectic manifolds.

Improves global counterfactual explanations for model recourse.

problem Inability to provide explanations beyond local instances.
method Investigates and improves Actionable Recourse Summaries (AReS) for global counterfactual explanations.
result Develops more efficient and interactive explainability tools.

Russia-Ukraine conflict impacts global agricultural futures and spot markets' extreme risks.

problem Impact of Russia-Ukraine conflict on global agricultural futures and spot markets' extreme risks.
method Analytical framework for tail dependence, Copula-CoVaR method, ARMA-GARCH-skewed Student-t model.
result The outbreak of the conflict intensified risks in the wheat market the most and showed significant asymmetries in extreme risk spillovers.

Generalizes Hoeffding's decomposition for dependent inputs under mild conditions.

problem Performing global sensitivity analysis on black-box models with dependent inputs.
method Proposes a novel framework based on probability theory, functional analysis, and combinatorics to handle dependencies.
result Any square-integrable, real-valued function of random elements with mild dependence assumptions can be uniquely additively decomposed.

Our work sheds new light on the role of oil prices in shaping the world economy by investigating flows of goods and services through global value chains between 1960 and 2011, by means of Markov Chain and network analysis. We show that over that time period the international division of labor and trade patterns are tig…

2015-02-28abs ↗pdf ↗

For a Riemannian manifold MnM^n with the curvature tensor RR, the Jacobi operator RXR_X is defined by RXY=R(X,Y)XR_XY = R(X,Y)X. The manifold MnM^n is called {\it pointwise Osserman} if, for every pMnp \in M^n, the eigenvalues of the Jacobi operator RXR_X do not depend of a unit vector XTpMnX \in T_pM^n, and is called {\it globall…

2003-10-24abs ↗pdf ↗

Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. Rank-breaking is a common practice to reduce the computational complexity of learning the global ranking. The individual preferences are broken into pairwise comparisons and applied t…

2016-01-21abs ↗pdf ↗

New method disentangles feature importance scores in machine learning.

problem Misinterpretation of feature importance scores due to interactions and dependencies.
method Derive DIP (Disentangled Importance) decomposition of feature importance scores.
result DIP decomposition uniquely separates standalone contributions from interactions and dependencies.

Gradient descent finds global optima in ResNets with sufficient parameters.

problem Finding optimal parameters in ResNet models.
method Mean-field analysis and gradient-flow PDE to study convergence of first-order optimization methods.
result First-order methods can find global minimizers in overparameterized ResNets.

Let M be a Riemannian manifold and R its curvature tensor. For a unit vector X tangent to M at a point p, the Jacobi operator is defined by R_X = R(X, .) X$. The manifold M is called pointwise Osserman if, for every point p, the spectrum of the Jacobi operator does not depend of the choice of X, and is called globally …

2002-04-22abs ↗pdf ↗

Unified local and global explanations through functional decomposition of low dimensional structures.

problem Tackles the challenge of extracting meaningful local and global explanations from machine learning models.
method Proposes a new identification constraint to decompose the global representation into main and interaction components of arbitrary order.
result Unified local and global explanations by connecting partial dependence plots and interventional SHAP values.

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.

Homotopy equivalence between formalities with different covariant derivatives.

problem Formality of Dolgushev depends on covariant derivative choice.
method Proved homotopy equivalence of LL_\infty-morphisms twisted by gauge equivalent elements.
result Globalized formalities with different covariant derivatives are homotopic.

We give nearly matching upper and lower bounds on the oracle complexity of finding εε-stationary points (F(x)ε\| \nabla F(x) \| \leqε) in stochastic convex optimization. We jointly analyze the oracle complexity in both the local stochastic oracle model and the global oracle (or, statistical learning) model. This allows u…

2019-02-13abs ↗pdf ↗

Model-agnostic interpretation methods can mislead if not used carefully.

problem Misinterpretation of machine learning models due to improper use of techniques.
method General pitfalls of model-agnostic interpretation methods.
result Many pitfalls exist when using global interpretation techniques for machine learning models.