LCD n-manifolds are linked to branched n-manifolds.
problem Characterizing compact n-manifolds locally.
method Equivalence between LCD and branched n-manifolds.
result LCD is equivalent to the existence of a branched n-manifold.
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,738 papers · 148 categories
Trend · papers per month
7 results for “LCD”
We study the performance of Local Causal Discovery (LCD), a simple and efficient constraint-based method for causal discovery, in predicting causal effects in large-scale gene expression data. We construct practical estimators specific to the high-dimensional regime. Inspired by the ICP algorithm, we use an optional pr…
We solve minimal separator problems in AMP chain graphs and improve structure learning algorithms.
problem Finding minimal separators in AMP chain graphs and learning their structure from data.
method We analyze and solve several versions of the minimal separator problem. We propose modifications to the PC-like algorithm and extend a decomposition-based method for AMP CGs.
result Our modifications of the PC-like algorithm and the LCD-AMP method improve structure learning and are more accurate and stable, especially in high-dimensional settings.
Causal effect estimation from observational data is an important and much studied research topic. The instrumental variable (IV) and local causal discovery (LCD) patterns are canonical examples of settings where a closed-form expression exists for the causal effect of one variable on another, given the presence of a th…
The paper investigates learning conditional distributions on multi-dimensional spaces using clustering and neural networks.
problem Learning conditional distributions on multi-dimensional spaces with varying dimensions.
method The approach involves clustering data near varying query points in the feature space to create empirical measures in the target space using two clustering schemes: fixed-radius ball and nearest neighbors. The convergence rates of both methods are analyzed, and the nearest neighbors method is incorporated into neural network training.
result The empirical analysis shows that the nearest neighbors method has better performance in practice and can adapt to a suitable level of Lipschitz continuity locally.
New method maps global value chains at product level from trade data.
problem Lack of detailed product-level value chain information in existing datasets.
method Machine learning and trade theory applied to international trade data.
result Approximate product-level value chain information inferred from trade patterns.
The generalized Cartan-Hadamard conjecture says that if is a domain with fixed volume in a complete, simply connected Riemannian -manifold with sectional curvature , then the boundary of has the least possible boundary volume when is a round -ball with constant curvature . The c…