Grid peeling and ACSF show similar behavior on convex curves.
problem Understanding the connection between computational and differential geometry processes.
method Empirical evidence and theoretical arguments.
result Grid peeling of N 2 \mathbb N^2 N 2 behaves similarly to ACSF on convex curves. One-Class Boundary Peeling detects outliers efficiently and robustly.
problem Unsupervised outlier detection in diverse data distributions.
method One-Class Boundary Peeling uses flexible boundaries generated by one-class SVMs and iteratively peels them.
result One-Class Boundary Peeling outperforms state-of-the-art methods in synthetic data simulations.
Study peels tensor equations on Schwarzschild spacetime.
problem Analyzing the asymptotic behavior of tensorial wave equations on Schwarzschild spacetime.
method Combining conformal compactification and vector field techniques to estimate tensorial field energies.
result Obtains optimal initial data for peeling at all orders.
New model explains neural collapse and limits on minority classes in imbalanced datasets.
problem Understanding and predicting performance limits of deep learning models on imbalanced datasets.
method Layer-Peeled Model, a nonconvex optimization program isolating top layers and applying constraints.
result Reveals a new phenomenon called Minority Collapse that limits deep learning models on minority classes.
New method for causal discovery using peeling algorithms for various data types.
problem Challenges in causal discovery due to unmeasured confounders.
method Two peeling algorithms (bottom-up and top-down) for causal discovery with generalized structural equation models.
result Valid discovery of causal relationships and parent-child effects in diverse data types.
Study of Dirac fields on Kerr spacetimes using peeling method.
problem Understanding decay and regularity of Dirac fields on Kerr spacetimes.
method Penrose conformal compactification and geometric energy estimates.
result Optimal initial data spaces for peeling of Dirac fields on Kerr spacetimes.
New supervised and unsupervised NFLTs for elliptical distributions.
problem Understanding unsupervised No Free Lunch Theorems for elliptical distributions.
method Proved two equally optimal strategies for elliptical distributions, inspired PRIM-based bump-hunting algorithms.
result Optimal strategies for selecting principal components based on variance or volume.
Faster algorithm for generalized mean densest subgraph problem.
problem Finding subgraphs with highest average p p p -th-power degree. method GENPEEL++ algorithm, which yields ( 2 ( p + 1 ) ) 1 / p (2(p+1))^{1/p} ( 2 ( p + 1 ) ) 1/ p -approximation for p ∈ [ 1 , + ∞ ) p \in [1, +\infty) p ∈ [ 1 , + ∞ ) with time complexity O ( m ( log n ) ) O(m(\log n)) O ( m ( log n )) . result GENPEEL++ algorithm provides faster and more efficient solution for generalized mean densest subgraph problem.
A new algorithm reduces graph complexity for better dense subgraph analysis.
problem Mining dense subgraphs in large graphs for better analysis.
method Multi-stage graph peeling algorithm (M-PA) with two-stage data screening.
result M-PA produces similar dense subgraphs to the previous PA but with reduced graph complexity.
In this paper, we show that the peeling property still holds for Bondi-Sachs metrics with nonzero cosmological constant under the boundary condition given by Sommerfeld's radiation condition together with three nontrivial Λ Λ Λ -independent functions B B B , a a a , b b b . This should indicate the new boundary condition is natura…
The paper uncovers symmetries in large language models through layer-peeled optimization.
problem Understanding geometric structure in large language model weights and context embeddings.
method Constrained layer-peeled optimization program to analyze symmetries in next-token distributions.
result Symmetries in target next-token distributions are transferred to optimal model weights and context embeddings.
New method speeds up solving L0-regularized least-squares problems.
problem Solving L0-regularized least-squares problems efficiently.
method Safe peeling for Branch-and-Bound algorithm.
result Significant gains in solving time and node exploration.
Study of Bondi-Sachs formalism for massless scalar field with zero cosmological constant.
problem Analyzing the Bondi-Sachs formalism for Einstein's massless scalar field equations.
method Asymptotic expansions and peeling property for Bondi-Sachs metrics and scalar fields.
result Positivity of Bondi energy-momentum under specific conditions.
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.
Paper explains neural collapse in neural networks using a new model.
problem Understanding neural collapse in neural networks during training.
method Introducing the unconstrained layer-peeled model (ULPM) to prove gradient flow convergence to critical points of a minimum-norm separation problem.
result Proves that all critical points are strict saddle points except the global minimizers exhibiting neural collapse.
The paper develops a robust algorithm for contextual bandits with heavy-tailed rewards.
problem Contextual bandits with heavy-tailed rewards.
method Develops an algorithm based on Catoni's estimator for robust statistics, applying it to contextual bandits with general function approximation.
result Establishes regret bounds that depend on cumulative reward variance and logarithmically on the reward range and number of rounds.
This paper investigates graph clustering in the planted cluster model in the presence of {\em small clusters}. Traditional results dictate that for an algorithm to provably correctly recover the clusters, {\em all} clusters must be sufficiently large (in particular, Ω ~ ( n ) \tildeΩ(\sqrt{n}) Ω ~ ( n ) where n n n is the number of nodes …
We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…
Significant improvements in regret analysis for adaptive online learning problems.
problem Exploiting low variance in online learning problems without known variances.
method Novel peeling-based regret analysis leveraging elliptical potential `count` lemma.
result Significant improvements in regret bounds for linear bandits and linear mixture MDPs.
The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.
problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in C P 2 \mathbb{CP}^2 CP 2 under certain conditions. Half grid diagrams prove every link can be represented by a special type of grid diagram.
problem Representing links using grid diagrams and related invariants.
method Defining half grid diagrams and constructing canonical pairs, proving equivalence to Jones' construction, relating to classical link invariants.
result Established a new method to relate the oriented Thompson index to classical link invariants and provided bounds for knot invariants.
Grid homology confirms the Upsilon invariant in knot theory.
problem Verifying the equivalence of Upsilon invariants in knot theory.
method Reconstructed Upsilon invariant using grid homology and proved equivalence.
result Upsilon invariants in knot Floer and grid homology are equivalent.
GridPyM handles grid diagrams for knot theory.
problem Handling grid diagrams for knot theory.
method Generates and simplifies grids, models local transformations.
result Models local transformations between grid diagrams.
Grid homology theory for spatial graphs extends skein sequence.
problem No specific problem stated; focuses on extending a sequence.
method Defined grid homology theory for spatial graphs and extended skein sequence.
result Skein exact sequence extended to grid homology for spatial graphs.
New method finds grid diagrams for many fibered knots.
problem Detecting fibered knots using grid diagrams.
method Developed an efficient method to identify grid diagrams with unique maximal Alexander grading states.
result Found suitable grid diagrams for 5385 of 5397 fibered prime knots with crossing number ≤ 13.
Extends knot invariant to filtered grid complexes.
problem Knot invariants and grid complexes.
method Combining Ozsváth-Szabó-Stipsicz crossing-change maps with Alishahi-Eftekhary l(K) invariant.
result Combinatorial formulation of knot invariant.
Grid homology properties for MOY graphs studied.
problem Defining and studying properties of grid homology for MOY graphs.
method Defined grid homology from Harvey and O'Donnol's work. Studied properties using oriented skein relation, edge contraction, and parallel edge unification.
result Properties of grid homology for MOY graphs were studied and defined.
Grid homology invariant proved for lens space links.
problem Proving combinatorial invariance of grid homology for lens space links.
method Combining combinatorial methods with sign assignments to prove invariance.
result Grid homology is a link invariant for lens space links.
New trading strategy beats traditional grid in crypto markets.
problem Low expected return of traditional grid trading strategy.
method Dynamic Grid Trading (DGT) strategy that adapts to market conditions.
result DGT strategy outperforms traditional grid and buy-and-hold strategies.
New method constructs moduli spaces of Lagrangian surfaces in CP^2 from grid diagrams.
problem Constructing explicit examples of triple grid diagrams for Lagrangian surfaces in CP^2.
method Elegant geometric construction reducing to linear algebra.
result Explicit construction of moduli space of triple grid diagrams.
Develops equivariant grid homology for strongly invertible knots.
problem Invariants of strongly invertible knots.
method Equivariant grid diagrams and mapping cones.
result Equivariant unknotting numbers and genus bounds.
Computes homology of an obstruction chain complex in grid homology.
problem Computing the homology of an obstruction chain complex in grid homology.
method Defined and computed the homology of the obstruction chain complex of the full grid.
result Results about the existence of sign assignments in grid homology.
Grid homology shows knot unknotting lower bound.
problem Knot unknotting number determination
method Grid homology analysis
result Torsion homology classes order bounds unknotting number
SKI accelerates GP inference with sparse grids to handle higher dimensions.
problem SKI scales poorly in high dimensions due to dense grid size.
method Sparse grids within SKI framework, novel matrix-vector multiplication algorithm.
result SKI can be scaled to higher dimensions while maintaining accuracy.
The paper develops algorithms to accurately identify power grid topology.
problem Identifying the exact topology of a power grid in real-time.
method Graphical model framework for topology estimation using voltage measurements.
result Exact extraction of operational topology is theoretically guaranteed for grid topologies without three-node cycles.
System detects power grid health using AI and machine learning.
problem Detecting and preventing power grid malfunctions.
method Artificial intelligence, machine learning, recurrent neural networks, SVM, LSTM.
result High accuracy in detecting grid health, scalable for complex architectures.
This paper improves image generation models using a multi-grid method.
problem Improving image generation models.
method A multi-grid method for learning energy-based generative ConvNet models.
result The multi-grid method outperforms traditional models.
Combinatorial proof shows knot invariant in Lipshitz's grid homology.
problem Proving knot invariance in Lipshitz's grid homology.
method Purely combinatorial proof.
result Proves 'minus' version of Lipshitz's double-point enhanced grid homology is a knot invariant.
The paper studies grid homology for spatial graphs and proves a Künneth formula for connected sums.
problem Understanding grid homology for spatial graphs with various types of edges.
method Developed grid homology for spatial graphs with cut edges and applied it to prove a Künneth formula for connected sums.
result A Künneth formula for knot Floer homology of connected sums is proven using grid homology.
Hexagon grid patterns emerge from conformal isometry in grid cell neural networks.
problem Understanding the algebraic, geometric, and topological properties of grid cells.
method Investigating recurrent neural network models of grid cells, focusing on Lie group and Lie algebra representations, conformal isometry, and hexagon periodic patterns.
result Conformal isometry leads to hexagon periodic patterns in grid cell responses and accurate path integration.
Minimal grid diagrams for 12-crossing prime knots identified.
problem Identifying minimal grid diagrams for prime knots.
method Listed minimal grid diagrams for 12-crossing prime knots.
result Provided a list of minimal grid diagrams for 12-crossing prime knots.
The paper analyzes how grid cells perform path integration and learns hexagon grid patterns.
problem Understanding how grid cells perform path integration calculations.
method Theoretical analysis of a general representation model of path integration by grid cells, identifying group representation and isotropic scaling conditions.
result The learned model of hexagon grid patterns is capable of accurate long distance path integration.
It will be shown that according to theorems of K. Menger, every neuron grid if identified with a curve is able to preserve the adopted qualitative structure of a data space. Furthermore, if this identification is made, the neuron grid structure can always be mapped to a subset of a universal neuron grid which is constr…
The increasing penetration of distributed energy resources poses numerous reliability issues to the urban distribution grid. The topology estimation is a critical step to ensure the robustness of distribution grid operation. However, the bus connectivity and grid topology estimation are usually hard in distribution gri…
Grid diagrams define invariants for knots in lens spaces.
problem Characterizing knots in lens spaces using grid diagrams.
method Using combinatorial grid diagrams to define invariants.
result Invariants are equivalent to those defined in previous works.
The paper studies how grid cell patterns emerge in neural networks.
problem Understanding how grid cells in the brain form hexagonal firing patterns.
method Training recurrent neural networks with conformal normalization of velocity inputs.
result Conformal normalization is crucial for the emergence of hexagonal grid patterns in neural networks.
Combinatorial proof of grid homology properties.
problem Properties of double-point enhanced grid homology.
method Purely combinatorial proof, extended to Z \mathbb{Z} Z coefficients. result Skein exact sequence obeyed by grid homology.
System identifies power grid location from media recordings.
problem Identifying the origin of power distribution grid from media recordings.
method Cascaded SVM and pole-matching classifiers for grid identification.
result Cascaded system improves accuracy by 15.57%.