Skeleton is a new notion designed for constructing space-filling curves of self-similar sets. It is shown in [Dai, Rao and Zhang, Space-filling curves of self-similar sets (II): Edge-to-trail substitution rule,https://doi.org/10.1088/1361-6544/ab1275] that for a connected self-similar set, space-filling curves can be c…
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
48 results for “skeleton design”
We consider the problem of learning a causal graph over a set of variables with interventions. We study the cost-optimal causal graph learning problem: For a given skeleton (undirected version of the causal graph), design the set of interventions with minimum total cost, that can uniquely identify any causal graph with…
New method certifies risks of LLM outputs, improving accuracy and reliability.
problem Uncertain and incorrect outputs from large language models.
method Information-lift certificates using PAC-Bayes bounds and skeleton design.
result Achieves 77.0% coverage at 2% risk, outperforming baselines.
Deep-Aligned Convolutional Neural Network for Skeleton-based Action Recognition and Segmentationcs.LG
DACNN improves skeleton-based action recognition and segmentation.
problem Lack of spatial relationships and non-uniform temporal scalings in skeleton-based data.
method Introduces deep-aligned convolutional neural network (DACNN) with new filters trained on local subsequences.
result DACNN achieves competitive performance compared to state-of-the-art models.
A new graph-based approach for estimating complex data with manifold structure.
problem Regression of large-scale, complex data with underlying geometric structure and noises.
method Constructing a skeleton graph to capture geometric structure, defining metrics, and applying nonparametric regression.
result Statistical guarantees and effectiveness demonstrated through simulations and real data examples.
Tensor neural network improves human pose classification from 3D skeleton data.
problem Efficiently processing spatiotemporal data for human pose classification.
method Proposes a tensor-based neural network with three components: spatiotemporal feature construction, tensor fusion, and tensor-based neural network processing.
result Achieves state-of-the-art performance in human pose classification.
The paper introduces negative controls to evaluate causal discovery algorithms, improving their reliability.
problem Lack of a general guideline for evaluating causal discovery algorithms.
method Derive exact distributional results under random guessing for evaluation metrics and propose a pipeline for using negative controls.
result Evaluation metrics can achieve very favorable values under random guessing, highlighting the need for negative control results.
SPOT improves differentiable causal discovery by estimating skeleton posterior for latent confounders.
problem Scalable and accurate estimation of causal skeletons in the presence of latent confounders.
method SPOT (Skeleton Posterior-guided OpTimization) framework that estimates skeleton posterior and integrates it with differentiable causal discovery.
result SPOT enhances differentiable causal discovery by reducing the search space and improving accuracy.
The study examines the topology of complements of polytopal skeletons.
problem Characterizing topological properties of polytopal complexes and their skeletons.
method Constructing a long exact sequence relating homologies of skeleton complements and links of faces.
result Characterizations of Cohen-Macaulay and Leray complexes, stacked balls, and neighbourly spheres in terms of skeleton complements.
Criterion for manifold skeletons embeddability in Euclidean space.
problem Embeddability of manifold skeletons in Euclidean space.
method Criterion based on the complement of a submanifold.
result Embeddability of -skeleton of a triangulation of an -bundle over into .
We have completely rewritten the paper, and corrected the proofs. We construct an exponential map at any point in the (n-1)-skeleton minus the (n-2)-skeleton of an n-dimensional Riemannian polyhedron. We have added allover the extra-assumption that the exponential map is totally geodesic at points in the (n-1)-skeleton…
The extension functors between categories of Cartan geometries can be used to define different categories of Cartan geometries with additional morphisms. The Cartan geometries modeled on skeletons can be used for the description of such categories of Cartan geometries and therefore we develop the theory of Cartan geome…
Fixed point sets of certain group actions are contractible.
problem Fixed point sets of group actions on specific types of complexes.
method Analyzing group actions on diagrammatically reducible complexes with fine 1-skeleton.
result Fixed point sets are contractible under certain conditions.
FMCIT accelerates CI tests for causal discovery, maintaining power and efficiency.
problem High computational complexity in CI tests limits practical applicability of causal discovery methods.
method Flow Matching-based Conditional Independence Test (FMCIT) that leverages flow matching for fast CI tests.
result FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis.
Skeleton clustering detects clusters in high-dimensional data without needing prototypes.
problem Detecting clusters in high-dimensional data with irregular shapes.
method Skeleton clustering combines prototype methods, density-based clustering, and hierarchical clustering using surrogate density measures.
result Skeleton clustering reliably detects clusters in multivariate and high-dimensional data.
Tensor-based method simplifies causal skeleton discovery.
problem Discover causal relationships between variables.
method Express associations as tensors to reduce dimensionality.
result Causal skeleton can be determined using pair-wise tensors.
Efficiently learns polytrees with known skeleton in polynomial time and sample complexity.
problem Learning polytrees with known skeleton structure.
method Proposes an efficient algorithm for learning -polytrees in polynomial time and sample complexity when the skeleton is known.
result Establishes finite-sample guarantees for efficient learning of -polytrees.
New theorem shows embedding restrictions for manifold skeletons.
problem Embedding restrictions for triangulated manifolds.
method Proves van Kampen-Flores theorem for manifolds with specific Stiefel-Whitney classes.
result Triangulated manifolds with non-trivial Stiefel-Whitney classes cannot embed into .
The Bezier simplex fitting is a novel data modeling technique which exploits geometric structures of data to approximate the Pareto front of multi-objective optimization problems. There are two fitting methods based on different sampling strategies. The inductive skeleton fitting employs a stratified subsampling from e…
Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints. However, node-link diagrams may fail to convey insights regarding graph structures, even for moderately sized data of a few hundred nodes, due to visual …
Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants complex, each isomorphic to the product of two Farey graphs. We deduce the existence of many convex planes in the 1-skeleton of the pants complex.
We are enveloped by stories of visual interpretations in our everyday lives. The way we narrate a story often comprises of two stages, which are, forming a central mind map of entities and then weaving a story around them. A contributing factor to coherence is not just basing the story on these entities but also, refer…
The present paper is devoted to the joint motion of two immiscible incompressible liquids in porous media. The liquids have different densities and initially separated by a surface of strong discontinuity (free boundary). We discuss the results of numerical simulations for exact free boundary problems on the microscopi…
Proposes a neural network for recognizing 3D skeleton-based interactions.
problem Recognizing two-person interactions from 3D skeleton sequences.
method Uses Gaussian distributions and Riemannian geometry of SPD matrices and matrix groups.
result Achieves competitive results on three benchmarks for 3D human activity understanding.
The paper finds and visualizes unique geometric polyhedra and tori with few vertices.
problem Finding and visualizing geometric polyhedra and tori with specific vertex configurations.
method Using Schlegel diagrams and geometric realization in 3D and 4D space.
result Identifies and visualizes 12 triangulations of the 2-torus and 12 triangulations of the 2D projective plane.
We create a 3-skeleton for a symmetric group's classifying space.
problem Classifying space construction for symmetric groups.
method Combining rewriting systems and combinatorial methods.
result Correctness of the constructed 3-skeleton.
A method for learning skeleton of Bayesian networks robust to outliers and corruption.
problem Learning the exact skeleton of discrete Bayesian networks from corrupted data.
method Distributionally robust optimization and regression approach, optimizing worst-case risk over distributions within bounded Wasserstein distance or KL divergence.
result Logarithmic sample complexities for successful structure learning of bounded-degree graphs.
We show that closed arithmetic hyperbolic n-dimensional orbifolds with larger and larger volumes give rise to triangulations of the underlying spaces whose 1-skeletons are harder and harder to embed nicely in Euclidean space. To show this we generalize an inequality of Gromov and Guth to hyperbolic n-orbifolds and find…
Every cubic graph is a bridge trisection's 1-skeleton for a knotted surface.
problem Understanding cubic graphs and their relation to bridge trisections.
method Proving every Tait-colored cubic graph is a 1-skeleton of a bridge trisection.
result Every Tait-colored cubic graph corresponds to a bridge trisection of a knotted surface.
Convex optimisation solves inverse kinematics problems more reliably.
problem Finding the best parameters of a kinematic skeleton from observed joint locations.
method Convex optimisation using semidefinite programming.
result The proposed method significantly outperforms local optimisation methods.
On a Weinstein manifold, we define a constructible co/sheaf of categories on the skeleton. The construction works with arbitrary coefficients, and depends only on the homotopy class of a section of the Lagrangian Grassmannian of the stable symplectic normal bundle. The definition is as follows. Take any, possibly high …
Develops a method to efficiently learn causal DAGs using directed clique trees.
problem Efficiently learning causal DAGs in the presence of large cliques.
method Decomposes DAGs into independently orientable components using directed clique trees and designs a two-phase intervention algorithm.
result Proves that the number of single-node interventions necessary to orient any DAG in an EC is at least the sum of half the size of the largest cliques in each chain component of the essential graph.
The one-skeleton of a G-manifold M is the set of points p in M where ; and M is a GKM manifold if the dimension of this one-skeleton is 2. Goresky, Kottwitz and MacPherson show that for such a manifold this one-skeleton has the structure of a ``labeled" graph, , and that the equivariant…
Finite simplicial complexes dominate certain manifolds with a bounded number of simplices.
problem Understanding the finite domination of manifolds by simplicial complexes.
method Proving that a manifold can be dominated by the -skeleton of a finite simplicial complex with a bounded number of simplices.
result The total number of simplices in the -skeleton is bounded above by a constant depending only on and the embolic volume of the manifold.
New algorithm reduces regret in combinatorial causal bandits without graph structure.
problem Minimizing regret in combinatorial causal bandits without graph structure.
method Design of algorithms for binary general causal models and BGLMs without graph skeleton.
result Achieves expected regret for causal models and for BGLMs.
We present a constructive proof that there exists a decomposition of the 2-skeleton of the k-dimensional cross polytope into closed surfaces of genus , each with a transitive automorphism group given by the vertex transitive -action on . Furthermore we show that for each $k \equiv …
Study Monge-Ampère equations on Calabi-Yau hypersurfaces, proving unique solutions and implications for special Lagrangian fibrations.
problem Existence of special Lagrangian fibrations in Calabi-Yau hypersurfaces.
method Non-Archimedean and tropical Monge-Ampère equations on Berkovich and skeleton spaces, proving uniqueness and deriving solutions.
result Unique solutions to tropical and non-Archimedean Monge-Ampère equations, leading to existence of special Lagrangian fibrations.
Study the limit of Calabi-Yau metrics with degenerate skeletons.
problem Understanding the behavior of Calabi-Yau metrics with degenerate skeletons.
method Using polarised degenerations and optimal transport problems.
result Describe the limiting behaviour of the Calabi-Yau potential.
We present a constructive proof, that there exists a decomposition of the 2-skeleton of the k-dimensional cross polytope β^k into closed surfaces of genus \leq 1, each with a transitive automorphism group given by the vertex transitive Z_{2k}-action on β^k. Furthermore we show, that for each k \equiv 1,5(6) the 2-skele…
The paper extends local h-principles to complex structures on Stein manifolds.
problem Existence of local h-principles for complex structures on Stein manifolds.
method Introducing realifications of partial holomorphic relations and proving h-principles for them.
result Local h-principles can be extended to complex structures on Stein manifolds.
Detection and skeletonization of single neurons and tracer injections using topological methodscs.CV
Topological methods improve neuron analysis and tracer injection summary.
problem Traditional methods fail to capture the tree-like structure of neurons.
method Discrete Morse (DM) Theory for neuron skeletonization and consensus tree summarization.
result Significant performance improvements over non-topological methods.
Study designs experiments to identify causal graph structure with cycles and latent confounders.
problem Identify causal graph structure with cycles and latent confounders.
method Established lower bounds, developed CI and do see tests algorithms, and proved tightness.
result Proposed algorithms can recover all causal edges except for double adjacent bidirected edges.
SAttention improves long sequence attention with smoothed skeleton sketching.
problem Quadratic complexity of vanilla Attention makes it unsuitable for long sequence tasks.
method SAttention uses smoothing and matrix sketching to balance information preservation and computation.
result SAttention significantly outperforms vanilla Attention and other Attention variants.
In this paper we propose the use of quantum genetic algorithm to optimize the support vector machine (SVM) for human action recognition. The Microsoft Kinect sensor can be used for skeleton tracking, which provides the joints' position data. However, how to extract the motion features for representing the dynamics of a…
We study the singularities of the isotropic skeleton of a Weinstein manifold in relation to Nadler's program of arboreal singularities. By deforming the skeleton via homotopies of the Weinstein structure, we produce a Morse-Bott* representative of the Weinstein homotopy class whose stratified skeleton determines its sy…
Non-abelian GKM Theorymath.DG
We describe a generalization of GKM theory for actions of arbitrary compact connected Lie groups. To an action satisfying the non-abelian GKM conditions we attach a graph encoding the structure of the non-abelian 1-skeleton, i.e., the subspace of points with isotopy rank at most one less than the rank of the acting gro…
We study Weinstein 4-manifolds which admit Lagrangian skeleta given by attaching disks to a surface along a collection of simple closed curves. In terms of the curves describing one such skeleton, we describe surgeries that preserve the ambient Weinstein manifold, but change the skeleton. The surgeries can be iterated …
Constructs unique bases for CY varieties over valued fields.
problem Finding unique bases for CY varieties over valued fields.
method Uses techniques from higher rank degenerations in K-stability.
result Induces canonical functions on skeletons and agrees with tropicalizations of theta functions.