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

123245368490 · Jun 202019922001200920172026
48 results for signed spaces

Signed seminorms linked to real tropical spaces and matroids.

problem Understanding signed seminorms and their real tropicalizations.
method Introducing signed Goldman-Iwahori space, identifying it as inverse limit of real tropicalizations, and giving matroid-theoretic description.
result Signed seminorms identified as inverse limit of real tropicalizations of projective space.

The article extends Thurston's Grafting Theorem to signed spaces and defines a framed monodromy map.

problem Extending Thurston's Grafting Theorem to signed spaces.
method Proves the analogue of Thurston's Grafting Theorem for signed spaces, defines a framed monodromy map.
result Characterizes PSL(2,C)-representations and shows the monodromy map is a local biholomorphism.

Study on blow-up behavior of sign-changing solutions for Yamabe equation.

problem Blow-up behavior of sign-changing solutions for Yamabe equation.
method Construction of a smooth metric on space forms to prove blow-up at lowest energy level.
result Blow-up occurs at the lowest energy level for sign-changing solutions in dimensions 11 to 24.

Study examines Kähler immersions of ALE Kähler metrics into complex space forms.

problem Kähler immersions of ALE Kähler metrics into complex space forms.
method Investigation of the relationship between Kähler immersions and the mass of ALE Kähler metrics.
result ALE Kähler metrics with positive mass do not admit a Kähler immersion into complex Euclidean space.

The paper defines grid homologies for singular links in lens spaces and constructs a resolution cube for knot Floer homology.

problem Defining and constructing a resolution cube for knot Floer homology of singular links in lens spaces.
method Defining grid homologies for singular links in lens spaces and using them to construct a resolution cube.
result A complete description of singular knot theory in lens spaces and a signed combinatorial resolution cube for knot Floer homology.

A new algorithm solves signed Fréchet regression on manifolds with bounded curvature.

problem Signed Fréchet regression on Riemannian manifolds with bounded curvature.
method Proximal DC algorithm (FRIDA) for computing signed Fréchet regression fits.
result Existence and interiority of minimizers, strong convexity of proximal subproblems, and convergence to stationary points.

Study on signed graphs with random signs, focusing on community detection.

problem Community detection in signed stochastic block models.
method Strong concentration inequalities for adjacency and Laplacian matrices, applied to signed Laplacian matrix.
result The sign of the first eigenvector of the Laplacian matrix defines a weakly consistent estimator for balanced community detection.

SELO model predicts link signs better than SDGNN using subgraph encoding and linear optimization.

problem Inferring the sign of links in signed networks with limited sign data.
method Subgraph Encoding via Linear Optimization (SELO) approach to learn edge embeddings.
result SELO model outperforms state-of-the-art methods on multiple real-world signed networks.

We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of the signed Laplacian may be meaningless, in contrast to partitioning based on th…

2017-01-05abs ↗pdf ↗

Novel GNN for signed and directed networks using magnetic signed Laplacian.

problem Efficiently modeling signed and directed networks for tasks like clustering and link prediction.
method Introduced a magnetic signed Laplacian for directed signed graphs, used it to construct a spectral GNN.
result Demonstrated effective performance on tasks involving signed and directional information.

Sign equivariant networks improve model expressiveness for spectral geometric learning.

problem Limited expressiveness of sign invariant models for tasks like graph link prediction.
method Developed sign equivariant neural network architectures based on new analytic sign equivariant polynomials.
result Sign equivariant models achieve theoretical benefits in spectral geometric learning tasks.

A Hilbert space embedding for probability measures has recently been proposed, wherein any probability measure is represented as a mean element in a reproducing kernel Hilbert space (RKHS). Such an embedding has found applications in homogeneity testing, independence testing, dimensionality reduction, etc., with the re…

2010-03-03abs ↗pdf ↗

The study investigates deformations of swallowtails in 3D space, preserving curvature signs.

problem Deforming swallowtails in 3D space while maintaining curvature signs.
method Representation formula for swallowtails, investigation of map germs, and analysis of Gaussian curvatures.
result Swallowtails can be deformed into a swallowtail of constant Gaussian curvature while preserving curvature signs.

In this short note, we compare the combinatorial sign assignment of Manolescu, Ozsvath, Szabo and Thurston for grid homology of knots and links in 3-sphere with the sign assignment coming from a coherent system of orientations on Whitney disks. Although these constructions produce different signs, a small modification …

2018-12-06abs ↗pdf ↗

PyTorch Geometric Signed Directed fills the gap for GNNs on signed and directed graphs.

problem Lack of unified software packages for GNNs on signed and directed networks.
method Developed a software package with GNN models, synthetic and real-world data, and evaluation metrics.
result Demonstrates the effectiveness of the implemented methods through experiments.

Paper introduces stable vectorization for multiparameter PH using signed barcodes.

problem Lack of stable vectorization methods for multiparameter persistent homology.
method Signed barcodes as measures for stable vectorization of MPH.
result Stable feature vectors from signed barcodes improve performance in data science.

The paper discovers patterns in Maass forms' coefficients related to Fricke signs.

problem Identifying Fricke signs in Maass forms with unknown signs.
method Averaging Fourier coefficients, Linear Discriminant Analysis (LDA), neural networks.
result 96% accuracy in predicting Fricke signs for forms with even parity, 94% for odd parity.

Novel CNN array for sign language recognition using wearable IMUs.

problem Efficiently recognizing sign language from wearable IMU signals.
method Two-dimensional Convolutional Neural Network array architecture for Indian sign language recognition.
result Peak classification accuracies of 94.20% for general sentences and 95.00% for interrogative sentences achieved.

In this paper we use theory of embedded graphs on oriented and compact PLPL-surfaces to construct minimal realizations of signed Gauss paragraphs. We prove that the genus of the ambient surface of these minimal realizations can be seen as a function of the maximum number of Carter's circles. For the case of signed Gaus…

2015-11-24abs ↗pdf ↗

CSNE embeds signed networks by separating structural and fine-grained information.

problem Improving sign prediction in signed networks using inaccurate or incomplete balance theories.
method Conditional Signed Network Embedding (CSNE) models structural and fine-grained information separately, integrating them rigorously.
result CSNE outperforms state-of-the-art on sign prediction tasks, and MaxEnt priors are competitive in resource-constrained settings.

The paper finds sign-changing solutions for a specific type of elliptic equation.

problem Existence of sign-changing solutions for a Yamabe type equation.
method Investigates a critical elliptic equation with a Yamabe type operator on a compact manifold with boundary.
result Existence of sign-changing solutions assured under certain geometric conditions.

Unified sign-based compression for federated learning with faster convergence.

problem High communication cost in federated learning with large-scale models.
method Unified noisy perturbation scheme for sign-based compression.
result Achieves faster convergence rate than existing sign-based methods.

Signed graphs encode positive (attractive) and negative (repulsive) relations between nodes. We extend spectral clustering to signed graphs via the one-parameter family of Signed Power Mean Laplacians, defined as the matrix power mean of normalized standard and signless Laplacians of positive and negative edges. We pro…

2019-05-15abs ↗pdf ↗

Signed-permutation coordinate transport improves model alignment across checkpoints.

problem Improper alignment of coordinate-indexed objects across model checkpoints.
method Introduces sign-marginalized Hungarian matching and coordinate-preserving transport.
result Recovering signed-permutation gauge improves coordinate alignment and model performance.

New method estimates tensors from noisy data with missing entries.

problem Tensor estimation from noisy observations with missing entries.
method Sign series representation for tensor completion, addressing low- and high-rank signals.
result Excess risk bounds, estimation error rates, and sample complexities established.

Develops method for learning signed graphs from smooth signals.

problem Learning signed graphs from observed data, especially in contexts with both positive and negative interactions.
method Uses net Laplacian as graph shift operator and minimizes total variation of observed signals with ADMM.
result Theoretical proofs of convergence and estimation error bound provided.

A new method learns node embeddings for signed directed networks by capturing both first-order and high-order topologies.

problem Learning representative node embeddings for signed directed networks considering both first-order and high-order topologies.
method Proposes a decoupled variational embedding (DVE) method that leverages a specially designed auto-encoder structure to capture both first-order and high-order topologies.
result Extensive experiments on real-world datasets show the effectiveness of DVE in link sign prediction and node recommendation tasks.

In this paper, we recover sparse signals from their noisy linear measurements by solving nonlinear differential inclusions, which is based on the notion of inverse scale space (ISS) developed in applied mathematics. Our goal here is to bring this idea to address a challenging problem in statistics, \emph{i.e.} finding …

2014-06-30abs ↗pdf ↗

We analyse the problem of assigning sign choices to O-planes in orientifolds of type II string theory. We show that there exists a sequence of invariant pp-gerbes with p1p\geq-1, which give rise to sign choices and are related by coboundary maps. We prove that the sign choice homomorphisms stabilise with the dimension…

2019-05-15abs ↗pdf ↗