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

Trend · papers per month

105210315420 · May 202619922001200920172026
48 results for Local Identifiability

New theory for local parameterization of deep ReLU networks.

problem Determining local parameters of deep ReLU neural networks.
method Introducing local lifting operators and charts of a manifold, deriving necessary and sufficient conditions for local identifiability.
result Sharp and testable conditions for local identifiability of deep ReLU networks.

Identifies Lorentzian locally symmetric spaces where Calabi operator suffices to determine Killing operator range.

problem Determining when the Calabi operator can identify the range of the Killing operator in Lorentzian locally symmetric spaces.
method Developed criteria for a connection to be in the range of a connection, applied to the Killing connection.
result For indecomposable spaces, the Calabi operator suffices to identify the range of the Killing operator; for products, it fails.

New proof shows how to identify DAGs with weakly increasing errors.

problem Identifying the true DAG in models with weakly increasing error variances.
method Minimum-trace DAG method and hill climbing algorithm with R2R neighborhood.
result Hill climbing algorithm without strict local optima under weakly increasing error variances.

New methods identify local clusters in graphs with few labels.

problem Identifying specific substructures in large graphs without additional structural information.
method Random sampling, diffusion, and overlap analysis of local clusters.
result Proves the correctness of the proposed methods and achieves state-of-the-art results.

We identify direct causes of a target variable from observational data without full DAG identifiability.

problem Learning direct causes of a target variable from observational data.
method Developed algorithms under relaxed identifiability assumptions for one environment without interventions.
result Identifiable set of direct causes from observational data under specific assumptions.

Proposes a method to identify causal relationships using background knowledge.

problem Identifying causal relationships in the presence of background knowledge.
method Learning local structure using all types of causal background knowledge (direct, non-ancestral, ancestral). Criteria for identifying causal relationships based on local structure.
result Effective and efficient method for local structure learning and causal relationship identification.

New method identifies important features and interactions in RF models.

problem Limited theoretical understanding of local feature and interaction importance in RF models.
method Combines global and local analysis to identify frequent feature co-occurrences.
result Proves consistent recovery of true local signal features and interactions.

We study the theoretical properties of learning a dictionary from NN signals xiRK\mathbf x_i\in \mathbb R^K for i=1,...,Ni=1,...,N via l1l_1-minimization. We assume that xi\mathbf x_i's are i.i.d.i.i.d. random linear combinations of the KK columns from a complete (i.e., square and invertible) reference dictionary $\mathbf D_0 \in…

2015-05-17abs ↗pdf ↗

b-LOAD extends local causal discovery with prior knowledge, improving causal effect estimation.

problem Local causal discovery struggles in data-scarce settings due to uncertainty and incomplete neighborhoods.
method b-LOAD incorporates prior knowledge directly into local structure learning, using Meek's rules to refine discovery.
result b-LOAD refines the admissible equivalence class and enlarges identifiable causal queries, improving causal effect estimation.

Bayesian framework for identifying localized regions of interest in dynamical systems.

problem Identifying regions of high-resolution uncertainty quantification in complex dynamical systems.
method Bayesian inference with Gaussian process surrogate and polynomial chaos expansion.
result Unified computational scheme reduces overall cost for uncertainty quantification.

Physical systems are modelled and investigated within simulation software in an increasing range of applications. In reality an investigation of the system is often performed by empirical test scenarios which are related to typical situations. Our aim is to derive a method which generates diverse test scenarios each re…

2018-10-04abs ↗pdf ↗

Study identifies subvarieties of projective varieties mapping to models.

problem Understanding mappings of subvarieties to models on projective varieties.
method Analyzes smooth projective varieties with holomorphic locally homogeneous structures.
result Determines all subvarieties mapping to the model.

We consider online detection strategies for identifying a change point in a stream of quantum particles allegedly prepared in identical states. We show that the identification of the change point can be done without error via sequential local measurements while attaining the optimal performance bound set by quantum mec…

2018-02-01abs ↗pdf ↗

CutMix training technique improves spatial locality in Vision Transformers.

problem Improving spatial locality in Vision Transformers trained from scratch.
method Comparison of Baseline and Modern training protocols on CIFAR-10, CIFAR-100, and Tiny-ImageNet.
result CutMix training component significantly reduces Mean Attention Distance (MAD) in early layers of Vision Transformers.

Improved learning of probabilistic box embeddings by modeling parameters with Gumbel distributions.

problem Local identifiability issues in geometric embeddings.
method Modeling box parameters with min and max Gumbel distributions, calculating expected intersection volume.
result Improves the ability of probabilistic box embeddings to learn.

This paper explores unsupervised learning of parsing models along two directions. First, which models are identifiable from infinite data? We use a general technique for numerically checking identifiability based on the rank of a Jacobian matrix, and apply it to several standard constituency and dependency parsing mode…

2012-06-14abs ↗pdf ↗

Study reveals structure of local minima in GMMs, identifying key cluster centers.

problem Identifying optimal cluster centers in non-convex GMM landscapes.
method Analyzing the negative log-likelihood function of GMMs in the population limit.
result Local minima share a common structure that partially identifies true cluster centers.

Formula for sections on complex manifolds with non-isolated components.

problem Localization of sections on complex manifolds with non-isolated zero varieties.
method Logarithmic Bott localization formula, current-theoretic formulation.
result Established a formula for sections on compact complex manifolds with non-isolated components.

Neural networks can learn relationships that traditional models cannot.

problem Identifying factors that differentiate neural networks from traditional models.
method Proving non-identifiability of neural networks compared to smooth parametric models.
result Neural networks can learn nontrivial relationships that traditional models cannot.

Equivariant localization techniques give a rigorous interpretation of the Witten genus as an integral over the double loop space. This provides a geometric explanation for its modularity properties. It also reveals an interplay between the geometry of double loop spaces and complex analytic elliptic cohomology. In part…

2019-11-25abs ↗pdf ↗

A motif-based framework identifies local spillover structures in financial markets.

problem Aggregate risk spillovers obscure local interaction patterns in systemic risk.
method Develops a motif-based framework using multiscale backbones and colored motifs.
result Motif-based portfolios outperform traditional benchmarks on risk-adjusted returns.

Develops a method to interpret deep learning models by identifying key features.

problem Revealing the decision-making process of blackbox models from raw data to predictions.
method Adversarial attacks to localize discriminative features with statistical guarantees.
result Locally identified features are both biologically plausible and statistically significant.

We consider random walks on locally compact groups, extending the geometric criteria for the identification of their Poisson boundary previously known for discrete groups. First, we prove a version of the Shannon-McMillan-Breiman theorem, which we then use to generalize Kaimanovich's ray approximation and strip approxi…

2018-12-18abs ↗pdf ↗

Locally symplectic structure found on Kerr space-time.

problem Understanding Kerr space-time using geodesics.
method Identifying locally conformally symplectic structure using characteristic classes and Kerr-Schild coordinates.
result Definition of cobordism category of contact 3-manifolds and locally conformally symplectic cobordisms.

RelatIF selects more intuitive training examples for explaining model predictions.

problem Influence functions identify outliers as explanatory examples, leading to poor explanations.
method RelatIF separates global and local influence, optimizing for local relative to global effects.
result Examples selected by RelatIF are more intuitive than those from influence functions.

We identify higher-charge configurations that satisfy Euler-Lagrange equations for the (strong coupling limit of) Faddeev-Hopf model, by means of adequate changes of the domain metric and a reduction technique based on αα-Hopf construction. In the last case it is proved that the solutions are local minima for the redu…

2008-12-24abs ↗pdf ↗

We study strict local martingales via h-transforms, a method which first appeared in Delbaen-Schachermayer. We show that strict local martingales arise whenever there is a consistent family of change of measures where the two measures are not equivalent to one another. Several old and new strict local martingales are i…

2007-11-07abs ↗pdf ↗

It is common for CCTV operators to overlook inter- esting events taking place within the crowd due to large number of people in the crowded scene (i.e. marathon, rally). Thus, there is a dire need to automate the detection of salient crowd regions acquiring immediate attention for a more effective and proactive surveil…

2014-10-14abs ↗pdf ↗

Local learning method selects covariates for causal effect estimation in the presence of latent variables.

problem Estimating causal effects from nonexperimental data with latent variables.
method Local learning approach that identifies valid adjustment sets for causal relationships.
result Ensures soundness and completeness of causal effect estimation under standard assumptions.

We consider locally conformal Kaehler geometry as an equivariant, homothetic Kaehler geometry (K,Γ). We show that the de Rham class of the Lee form can be naturally identified with the homomorphism projecting Γto its dilation factors, thus completing the description of locally conformal Kaehler geometry in this equivar…

2010-01-27abs ↗pdf ↗

New method removes interference bias in causal models.

problem Interference bias impedes causal effect identification in real-world settings.
method Novel definition of causal models with local interference, semi-parametric assumptions.
result True Average Causal Effect can be identified in certain semi-parametric models with local interference.

New algorithm identifies causal effects in latent confounding models.

problem Identifying causal effects in linear non-Gaussian models with latent confounding.
method Recursive algorithm using rank conditions on higher-order cumulants.
result Algorithm achieves comparable performance to overcomplete ICA without knowing the number of latent variables.