The paper explores centroaffine geometry of polygons and their duals.
problem Understanding centroaffine dual pairs of spatial polygons.
method Defining centroaffine dual pairs and proving properties of polygon duals.
result Constant curvature polygons are dual to planar polygons.
This paper continues the previous studies in two papers of Huang-Yin [HY3-4] on the flattening problem of a CR singular point of real codimension two sitting in a submanifold in Cn+1 with n+1≥3, whose CR points are non-minimal. Partially based on the geometric approach initiated in [HY3] and a forma…
We discuss Ghys' theorem on 4 zeroes of the Schwarzian derivative and its relation with flattening points of Legendrian curves and Sturm theory.
A primary goal in this paper is to study the question that asks when a real analytic submanifold M in Cn+1 bounds a real analytic (up to M) Levi-flat hypersurface M^ near p∈M such that M^ is foliated by a family of complex hypersurfaces moving along the normal direction of M at …
Paper studies spaces of flattenings of simplicial spheres and their homotopy type.
problem Existence and uniqueness of differentiable structures on simplicial spheres.
method Analyzes spaces of flattenings of simplicial spheres and their homotopy type.
result Spaces of flattenings have the homotopy type of the orthogonal group.
Flattenings of knotted surfaces help define new invariants.
problem Understanding and quantifying knotted surfaces in 4-sphere.
method Using hyperbolic decompositions and projections onto 2-sphere.
result Introduced layering, trunk, and partition number invariants.
This study develops a NURBS-based method for conformal surface flattening without singularities.
problem Flatten surfaces conformally without singularities.
method NURBS-based approach with iterative refinement of input and flattening surfaces, leveraging nonlinear extension of VarPro.
result Developed a singularity-free NURBS-based method for conformal surface flattening.
We consider in this paper the FRS-deformations of a family of space curves with codimension ≤3. Some geometric aspects of a space curve such as flattenings, vertices and twistings points has been studied.
New neural networks flatten and reconstruct manifolds from samples.
problem Learning from high-dimensional data embedded in submanifolds.
method Flattening Networks (FlatNet) that linearize and reconstruct embedded submanifolds.
result FlatNet achieves balance of interpretability, feasibility, and generalization.
The study proves a discrete version of Segre's theorem for polygonal curves.
problem Proving a discrete analog of a four-vertex theorem for spherical curves.
method Using the concept of discrete tangent indicatrix of a polygon.
result A polygon with at least four vertices and a non-self-intersecting discrete tangent indicatrix has at least four flattenings.
A new algorithm flattens multi-modal distributions for better deep learning.
problem Bayesian learning in big data with multi-modal distributions.
method Contour Stochastic Gradient Langevin Dynamics (CSGLD) algorithm.
result The CSGLD algorithm avoids local traps in deep neural networks.
A method to automatically and symbolically detect and resolve degenerate parameter combinations from parameter-data pairs.
problem Identifying degenerate parameter combinations in physical models or real-world datasets.
method The degeneracy distillery method detects and resolves degenerate parameter combinations from parameter-data pairs.
result The method reduces the simulation budget required for downstream neural posterior estimation.
In this paper, we are concerned with the problem of creating flattening maps of simply-connected open surfaces in R3. Using a natural principle of density diffusion in physics, we propose an effective algorithm for computing density-equalizing flattening maps with any prescribed density distribution. By var…
Any smooth surface in R^3 may be flattened along the z-axis, and the flattened surface becomes close to a billiard table in R^2 . We show that, under some hypotheses, the geodesic flow of this surface converges locally uniformly to the billiard flow. Moreover, if the billiard is dispersive and has finite horizon, then …
AWP improves robustness by flattening weight loss landscape.
problem Improving robustness of deep neural networks against adversarial examples.
method Explicitly regularizes the flatness of weight loss landscape through adversarial weight perturbation.
result AWP forms a double-perturbation mechanism in adversarial training, leading to flatter weight loss landscape.
Given a point (the "spider") on a rectangular box, we would like to find the minimal distance along the surface to its opposite point (the "fly" - the reflection of the spider across the center of the box). Without loss of generality, we can assume that the box has dimensions 1×a×b with the spider on one …
Analyzes Gerstner's trochoidal waves and their geometric properties.
problem Understanding the geometry and kinematics of trochoidal waves.
method Derives velocity and arc length conditions for cycloidal, curtate, and prolate trochoids using Galilean transformations.
result Conditions for arc lengths of prolate and curtate trochoids to coincide over a wave cycle.
The paper explores how symmetries and noise in SGD influence parameter dynamics.
problem Understanding the dynamics of parameter updates in SGD with symmetries.
method Proved the existence of noise equilibria and showed their role in balancing gradient noise.
result Gradient noise creates a systematic motion of parameters to a unique fixed point, called noise equilibria.
Method flattens complex surfaces with consistent density and shape.
problem Shape deformations and local geometric distortions in density-equalizing maps for multiply-connected surfaces.
method Formulates density diffusion as a quasiconformal flow, solving an energy minimization problem involving the Beltrami coefficient to ensure bijectivity and control distortion.
result Achieves optimal parameterization of multiply-connected surfaces with bijective and controlled geometric distortions.
Theory explains power-law distributions without complex models.
problem Understanding power-law distributions in geometrically growing systems.
method Developed a theory of geometrically growing systems and applied it to explain various distributions.
result The geometrically growing system's distribution flattens over time, increasing relative size ratios.
A mathematical model describes deforming manifolds with precise vectors and fields.
problem Modeling and describing the deformation of complex manifolds in practical applications.
method Proposes a modified differential dynamic model with constraints on spatial and temporal continuity, presenting deforming vector and field.
result Demonstrates the effectiveness of an autonomous deforming field in data dimension reduction tasks.
TRNN combines tensor geometry with neural network nonlinearity for HD data.
problem Modeling high-dimensional data with preserved tensor geometry and nonlinear interactions.
method Introduces TRNN that integrates tensor geometry and neural network nonlinearity.
result TRNN preserves tensor geometry while offering nonlinearity.
Analyzes how BatchNorm flattens the loss landscape in neural networks.
problem Understanding BatchNorm's impact on neural network optimization.
method Mean-field theory applied to quantify BatchNorm's effect on loss landscape.
result BatchNorm flattens the loss landscape, allowing for larger learning rates.
A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, t…
A flat Klein bottle is visualized using origami.
problem Visualizing a Klein bottle's flatness and topology.
method Curved-crease origami with inelastic film.
result The sculpture illustrates both flatness and non-orientability.
Deep learning boosts cable capacity by 19%.
problem Maximizing cable capacity under power constraints.
method Optimized launch powers using deep neural networks.
result 19% increase in capacity per Watt.
AutoGraph uses transformers to efficiently generate graphs as sequences.
problem Efficiently generating large, sparse graphs without expensive node features.
method Flattening graphs into sequences and using decoder-only transformers.
result AutoGraph achieves state-of-the-art performance on synthetic and molecular benchmarks.
Large-scale classification of data where classes are structurally organized in a hierarchy is an important area of research. Top-down approaches that exploit the hierarchy during the learning and prediction phase are efficient for large scale hierarchical classification. However, accuracy of top-down approaches is poor…
Standard bubbles and partitions are stable in various model spaces.
problem Stability of standard bubbles and partitions in different model spaces.
method New conjugated Brascamp-Lieb inequality and conformally flattening boundary potential.
result Stability of standard bubbles and partitions in Rn, Sn, and Hn. New Holder bounds improve variational inference by flattening thermodynamic curves.
problem Improving variational inference by addressing performance gaps between theory and practice.
method Generalizing thermodynamic integration to weighted Holder mean, introducing Holder bounds.
result Holder bounds promise a one-step approximation of exact marginal log-likelihood.
Graph neural networks detect anomalies in object-centric business processes.
problem Detecting anomalies in graph-like business processes.
method Graph convolutional autoencoder architecture for anomaly detection.
result Promising performance in detecting anomalies at the activity type and attributes level.
Study identifies cancer genes through graph anomaly analysis of protein interactions.
problem Insufficient modeling of biological information in protein interaction networks for cancer gene identification.
method Proposes HIerarchical-Perspective Graph Neural Network (HIPGNN) to detect weight heterogeneity and spectral flattening in cancer gene nodes.
result HIPGNN detects weight heterogeneity and spectral flattening, leading to improved cancer gene identification.
The paper concerns discrete versions of the three well-known results of projective differential geometry: the four vertex theorem, the six affine vertex theorem and the Ghys theorem on four zeroes of the Schwarzian derivative. We study geometry of closed polygonal lines in $\bbRP^d$ and prove that polygons satisfying a…
PPOS improves PPO by smoothing the surrogate objective function.
problem Performance instability and optimization inefficiency in PPO.
method Use of a functional clipping method instead of a flat clipping method.
result PPOS conducts more accurate updates and outperforms other PPO variants.
Averaged Gradient Descent improves performance in rough landscapes.
problem Minimizing strongly non-convex functions in high-dimensional estimation problems.
method Empirical average of gradients over random positions in parameter space.
result Averaged Gradient Descent outperforms existing methods in tensor PCA.
Graph neural networks help AI agents learn more complex language.
problem Understanding how AI agents learn and use language.
method Developed graph referential games to compare different AI models.
result Graph neural networks enable AI to learn more complex, compositional language.
New method flattens decision boundary by targeting shortcut-aligned axes in disentangled latent space.
problem Shortcut learning in neural networks, leading to poor out-of-distribution generalization.
method Injects targeted anisotropic noise to regularize classifier sensitivity along shortcut-aligned axes.
result Achieves state-of-the-art OOD performance without shortcut labels or conflicting samples.
The Dirichlet eigenvalues of the Laplace-Beltrami operator are larger on an annulus than on any other surface of revolution in R3 with the same boundary. This is established by defining a sequence of shrinking cylinders about the axis of symmetry and proving that flattening a surface outside of each cylinde…
We find flat band Hamiltonians and Ginsparg-Wilson relations for symmetry classes.
problem Finding flat band Hamiltonians and Ginsparg-Wilson relations for symmetry classes.
method Integrating out the additional bulk direction to obtain effective Dirac operators and then deriving flat and overlap Dirac operators.
result Established Ginsparg-Wilson relations and mod-two index theorems for each symmetry class.
We develop a tractable model of realization utility that studies the role of reference-dependent S-shaped preferences in a dynamic investment setting with reinvestment. Our model generates both voluntarily realized gains and losses. It makes specific predictions about the volume of gains and losses, the holding periods…
A new activation function FTS improves deep learning performance.
problem Hindered propagation of negative values in ReLU.
method Proposed Flatten-T Swish (FTS) activation function, evaluated on MNIST dataset.
result FTS with T=-0.20 improves MNIST classification accuracy by 1.15% on 8-layer DFNN.
This paper studies geometrical structure of the manifold of escort probability distributions and shows its new applicability to information science. In order to realize escort probabilities we use a conformal transformation that flattens so-called alpha-geometry of the space of discrete probability distributions, which…
We study the topology of the space $\d\K^n$ of complete convex hypersurfaces of Rn which are homeomorphic to Rn−1. In particular, using Minkowski sums, we construct a deformation retraction of $\d\K^n$ onto the Grassmannian space of hyperplanes. So every hypersurface in $\d \K^n$ may be flattened in a canonic…
Let K be an algebraically closed field endowed with a complete non-archimedean norm with valuation ring R. Let f:Y -> X be a map of K-affinoid varieties. In this paper we study the analytic structure of the image f(Y) in X; such an image is a typical example of a subanalytic set. We show that the subanalytic sets are p…
Learning an encoding of feature vectors in terms of an over-complete dictionary or a information geometric (Fisher vectors) construct is wide-spread in statistical signal processing and computer vision. In content based information retrieval using deep-learning classifiers, such encodings are learnt on the flattened la…
B. Fedosov has given a simple and very natural construction of a deformation quantization for any symplectic manifold, using a flat connection on the bundle of formal Weyl algebras associated to the tangent bundle of a symplectic manifold. The connection is obtained by affinizing, nonlinearizing, and iteratively flatte…
We study the basic properties of Higgs sheaves over compact Kähler manifolds and we establish some results concerning the notion of semistability; in particular, we show that any extension of semistable Higgs sheaves with equal slopes is semistable. Then, we use the flattening theorem to construct a regularization of a…
The study examines when large trades are considered news or liquidity shocks in a market model.
problem Understanding when large trades are news or liquidity shocks in a market model.
method A sequential competitive limit order book model with asymmetric information and Student-t tails for liquidity demand.
result Heavy-tailed liquidity demand flattens and concavifies price impact, delaying price discovery.