New method escapes local optima in neural architecture optimization.
problem Escaping local optima in neural architecture optimization.
method Signed neural splitting in steepest descent framework.
result Escapes local optima, leading to better performance.
We give a presentation for a non-split compact surface embedded in the 3-sphere by using diagrams of spatial trivalent graphs equipped with signs and we define Reidemeister moves for such signed diagrams. We show that two diagrams of embedded surfaces are related by Reidemeister moves if and only if the surfaces repres…
This study generalizes an econophysics model to account for trader heterogeneity, finding robust power-law exponents but sensitive prefactors.
problem The original Lillo-Mike-Farmer model assumed homogeneity in traders' order-splitting strategies, which this study generalizes.
method The study proposes a generalised Lillo-Mike-Farmer model and solves it exactly without heuristic assumptions.
result The power-law exponent in the order-sign ACF is robust for arbitrary heterogeneous intensity distributions, but the prefactor is sensitive to heterogeneity.
New method combines randomization tests and flexible models for valid inference without splitting data.
problem Valid inference in randomized panel experiments with complex effect heterogeneity.
method Model-assisted randomization tests that estimate unsigned CATE from residualized outcomes.
result CATE-assisted tests control Type I error and achieve higher power than alternatives.
Study validates Lillo-Mike-Farmer model predicting financial market long-range correlations.
problem Quantifying long-range correlations in financial markets.
method Analyzed nine years of market data to classify traders as order-splitting or random, measured metaorder-length distributions, and compared to LMF model predictions.
result Agreement between LMF model predictions and actual data, validating the model.
SBSS uses similarity to split data for better classifier training.
problem Training better classifiers with realistic performance estimation.
method SBSS uses both input and output space information to split data using similarity functions.
result SBSS outperformed ordinary stratified 10-fold cross-validation in 75% of scenarios.
Quantitative analysis of order-splitting behavior in Japanese stock market.
problem Understanding and quantifying the order-splitting behavior of traders in the Japanese stock market.
method Analysis of a large dataset of trading accounts over nine years, clustering traders into order-splitting and random traders, and applying statistical methods to analyze metaorder length and sign correlation.
result The metaorder length distribution follows power laws with exponent α, and the sign correlation exponent γ is approximately α-1, supporting the LMF model.
This paper begins with an observation that the isospectral leaves of the signed Toda lattice as well as the Toda flow itself may be constructed from the Tomei manifolds by cutting and pasting along certain chamber walls inside a polytope. It is also observed through examples that although there is some freedom in this …
Order flow in equity markets is remarkably persistent in the sense that order signs (to buy or sell) are positively autocorrelated out to time lags of tens of thousands of orders, corresponding to many days. Two possible explanations are herding, corresponding to positive correlation in the behavior of different invest…
Recent empirical studies have demonstrated long-memory in the signs of orders to buy or sell in financial markets [2, 19]. We show how this can be caused by delays in market clearing. Under the common practice of order splitting, large orders are broken up into pieces and executed incrementally. If the size of such lar…
We study the Seiberg-Witten invariant λSW(X) of smooth spin 4-manifolds X with integral homology of S1×S3 defined by Mrowka, Ruberman, and Saveliev as a signed count of irreducible monopoles amended by an index-theoretic correction term. We prove a splitting formula for this invariant in terms …
Smooth Z2n-supermanifolds have been introduced and studied recently. The corresponding sign rule is given by the "scalar product" of the involved Z2n-degrees. It exhibits interesting changes in comparison with the sign rule using the parity of the total degree. With the new rule, nonzero degre…
Identifies a mod-p triple cup product for rational homology 3-spheres with specific first homology.
problem Locally flat embeddings in S4 for rational homology 3-spheres method Using triple torsion linking form and torsion-linking duality
result Identifies the mod-p triple cup product for specific rational homology 3-spheres This paper diagnoses factor-model pricing errors using a new method.
problem Measuring pricing errors in factor models with general characteristic axes.
method Developed a method to measure factor-model pricing errors as bridge-alpha curves, using a predetermined characteristic order and prefix portfolios.
result Adding a counterpart factor flips the curve's sign on every axis, but only HML and CMA overcorrect enough to be rejected.
The Seiberg-Witten equation with multiple spinors generalises the classical Seiberg-Witten equation in dimension three. In contrast to the classical case, the moduli space of solutions M can be non-compact due to the appearance of so-called Fueter sections. In the absence of Fueter sections we define a sign…
Let D be a reduced alternating diagram of a non-split link L and L~ be the link whose diagram is obtained from D by a crossing change. If L~ is alternating, then c(L~)≤c(L)−2. In this paper we explore when c(L~)=c(L)−2 holds and obtain a simple sufficient and necessary cond…
Sparse covariance estimation in the vertical-split model achieves exponential improvement over dense estimates.
problem Minimax estimation error for distributed covariance matrix estimation in the vertical-split setting.
method Elementwise s-sparsity is shown to reduce communication and sample complexity. result Minimax lower bounds for 1-sparse cross-covariance estimation are established. Study categorizes Vaisman manifolds with vanishing first Chern class and finds canonical metrics.
problem Characterizing Vaisman manifolds with vanishing first Chern class.
method Categorization into three types based on Bott-Chern class sign, showing canonical metrics, quasi-regularity, stability, and automorphism group behavior.
result Vaisman manifolds with non-positive Bott-Chern class admit canonical metrics and are stable under deformations.
Skew-adaptive method improves prediction intervals for regression.
problem Improving prediction intervals for regression models, especially in cases of skewness and varying scales.
method Develops a skew-adaptive extension of split conformal prediction using an asymmetric interval family and gauge approach.
result Preserves marginal validity and adapts to local scale and skewness, with efficiency gains over existing methods.
Quite a number of Z2n-gradings, n≥2, appear in Physics and in Mathematics. The corresponding sign rules are given by the `scalar product' of the involved Z2n-degrees. The new theory exhibits challenging differences with the classical one: nonzero degree even coordinates are not nilpotent…
Characterizes alternating links in thickened surfaces using Gordon-Litherland pairing.
problem Identifying alternating links in thickened surfaces.
method Extension of Gordon-Litherland pairing to thickened surfaces.
result A non-split link in a thickened surface is alternating if and only if it bounds two definite surfaces of opposite sign.
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…
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.
This paper proves a symplectic formula for SU(n) generalized Casson invariants.
problem Establishing a relationship between gauge theory and generalized Casson invariants.
method Using intersection numbers of Lagrangian submanifolds.
result Analogous identification result for SU(n) generalized Casson invariants.
Let (G,h) be a nilpotent Lie group endowed with a left invariant Riemannian metric, g its Euclidean Lie algebra and Z(g) the center of g. By using an orthonormal basis adapted to the splitting $\mathfrak{g}=(Z(\mathfrak{g})\cap[\mathfrak{g},\mathfrak{g}])\oplus O^+\oplus (Z(\mat…
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.
Defines signed quasiregular curves and proves growth theorem.
problem Understanding growth of signed quasiregular curves.
method Proves weak reverse Hölder inequality and uses it to prove growth theorem.
result Proves growth theorem for signed quasiregular curves.
Signed networks contain both positive and negative kinds of interactions like friendship and enmity. The task of node classification in non-signed graphs has proven to be beneficial in many real world applications, yet extensions to signed networks remain largely unexplored. In this paper we introduce the first analysi…
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 …
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.
Proposes a privacy-preserving sign selection method for distributed systems.
problem Sign selection in distributed differentially private settings.
method Iterative peeling of stability function combined with exponential mechanism.
result Recovery of support and signs with optimal signal-to-noise ratio.
Estimates graph curvature and diameter using Laplacian eigenvalues.
problem Estimating graph curvature and diameter using Laplacian eigenvalues.
method Combination of gradient estimates and strong nodal domain walks.
result Li-Yau type eigenvalue-diameter estimate for signed graphs.
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.
The recognition of sign language is a challenging task with an important role in society to facilitate the communication of deaf persons. We propose a new approach of Spatial-Temporal Graph Convolutional Network to sign language recognition based on the human skeletal movements. The method uses graphs to capture the si…
In this paper we use theory of embedded graphs on oriented and compact PL-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…
Optimal SD improves ridge regression performance strictly and precisely.
problem Improving ridge regression performance through self-distillation.
method Analyzes unconstrained SD for ridge regression, deriving optimal mixing weight and asymptotic risk.
result Optimal SD strictly improves ridge regression performance, with exact risk equivalents derived.
Method predicts which high-dimensional correlation signs will change in the future.
problem Predicting which correlation matrix coefficients will change signs in high-dimensional data.
method Stability of correlation signs depends on three-by-three relationships, inspired by Heider social cohesion theory.
result The method accurately predicts the stability of correlation signs in high-dimensional data.
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.
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 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…
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.
Signed heights of knotoids are defined and studied.
problem Understanding the signed height of knotoids.
method Defined positive and negative parts of height, proved they determine unsigned height, provided lower bounds with polynomials, studied associated sequences.
result Positive and negative parts of height determine unsigned height.