Detects dense subhypergraphs in heterogeneous random hypergraphs.
problem Testing for the existence of a dense subhypergraph in heterogeneous random hypergraphs.
method Established detection boundaries and constructed asymptotically powerful and adaptive tests.
result Developed tests for distinguishing between null and alternative hypotheses.
Currents on cusped hyperbolic surfaces have a denseness property similar to compact surfaces.
problem Proving denseness of rational currents on cusped hyperbolic surfaces.
method Using geodesic currents and subset currents, proving denseness through examples and continuous extension.
result Denseness of rational currents on cusped hyperbolic surfaces, including geodesics connecting cusps.
The key idea of current deep learning methods for dense prediction is to apply a model on a regular patch centered on each pixel to make pixel-wise predictions. These methods are limited in the sense that the patches are determined by network architecture instead of learned from data. In this work, we propose the dense…
One of the key challenges of visual perception is to extract abstract models of 3D objects and object categories from visual measurements, which are affected by complex nuisance factors such as viewpoint, occlusion, motion, and deformations. Starting from the recent idea of viewpoint factorization, we propose a new app…
Generative model captures hubs and dense communities in social networks.
problem Capturing both hubs and dense communities in social networks.
method Graphon mixture model with a new condition on sparse graphs.
result Estimation of hub normalized degree and graphon for sparse components.
New method learns robot actions from videos without explicit labels.
problem Training robots to perform tasks from few demonstrations.
method Uses images and text for task-agnostic and general representation, synthesizes hallucinated actions, and applies dense correspondences.
result Trains robot policies solely from RGB videos, achieving diverse tasks across different robots and environments.
Maximal cusps are not dense on Teichmüller space for infinite-type surfaces.
problem Characterizing dense points in the Bers boundary of Teichmüller space for infinite-type surfaces.
method Quasiconformal deformations and analytic conditions.
result Maximal cusps cannot approach certain points on the Bers boundary.
For a wide range of clinical applications, such as adaptive treatment planning or intraoperative image update, feature-based deformable registration (FDR) approaches are widely employed because of their simplicity and low computational complexity. FDR algorithms estimate a dense displacement field by interpolating a sp…
We analyze the sample complexity of learning graphical games from purely behavioral data. We assume that we can only observe the players' joint actions and not their payoffs. We analyze the sufficient and necessary number of samples for the correct recovery of the set of pure-strategy Nash equilibria (PSNE) of the true…
Finding "densely connected clusters" in a graph is in general an important and well studied problem in the literature \cite{Schaeffer}. It has various applications in pattern recognition, social networking and data mining \cite{Duda,Mishra}. Recently, Ames and Vavasis have suggested a novel method for finding cliques i…
The paper explores graphons of line graphs from sparse finite graphs.
problem Estimating graph limits from sparse finite graphs.
method Mapping finite graphs to their line graphs and analyzing graphs with the square-degree property.
result Graphons of line graphs can distinguish between sparse graphs like star graphs and superlinear preferential attachment graphs.
The square-peg problem is solved using configuration spaces and multijet transversality.
problem Proving that every simple closed curve in the plane has an odd number of inscribed squares.
method Using the multijet transversality theorem and configuration spaces, we find a dense set of smooth embeddings for which the configuration space of points is transverse to any submanifold.
result A dense family of smoothly embedded circles in the plane and in Rn have an odd number of inscribed square-like quadrilaterals. Cataclysm deformations study Anosov representations and their convergence.
problem Understanding convergence of Anosov representations under deformation.
method Cataclysm deformation of Anosov representations using twisted transverse cocycles.
result Uniform convergence of cataclysm deformations on compact sets.
Cataclysm deformations study Anosov representations, leading to new formulas and non-open sets.
problem Understanding Anosov representations and their deformations.
method Cataclysm deformations based on twisted transverse cocycles.
result Uniform convergence of cataclysm deformations on compact sets.
Sparse Hopfield model improves memory retrieval with fewer connections.
problem Memory retrieval efficiency with fewer connections.
method Sparse extension of Hopfield model, derived from sparse entropic regularizer.
result Sparse Hopfield model achieves tighter error bounds and better performance.
In this paper we investigate the space of harmonic maps from a 2-torus to S3 using the spectral curve correspondence and Whitham deformations. In an open and dense subset of a parameter space we find that the space of harmonic maps is smooth and has dimension two. We also show that the points that correspon…
Extends DAMs to Gaussian distributions for efficient pattern storage and retrieval.
problem Limited storage capacity and retrieval methods for non-vector pattern representations.
method Introduces a log-sum-exp energy function over Gaussian distributions, using optimal transport maps for retrieval dynamics.
result Proves exponential storage capacity and provides quantitative retrieval guarantees.
We describe, under some additional technical assumptions, the Gromov boundary of the free product of several Gi's amalgamated wrt. H, where Gi are hyperbolic groups with boundary homeomorphic to a densely punctured n-sphere, and H is their common subgroup corresponding to a peripheral sphere in each of the …
Transforming sparse outcomes into dense process rewards for efficient reinforcement learning.
problem Training RL policies to maximize sparse outcomes.
method Incentivizing policy matching state-action visitations of successful episodes.
result Significantly faster RL finetuning performance.
Using a Bayesian approach, we consider the problem of recovering sparse signals under additive sparse and dense noise. Typically, sparse noise models outliers, impulse bursts or data loss. To handle sparse noise, existing methods simultaneously estimate the sparse signal of interest and the sparse noise of no interest.…
Method matches noisy remote sensing images robustly.
problem Matching noisy remote sensing images.
method Combining attention mechanism with feature enhancement.
result More efficient and accurate matches achieved.
We prove that the Teichmueller disc stabilized by the Arnoux-Yoccoz pseudo-Anosov diffeomorphism contains at least two closed Teichmueller geodesics. This proves that the corresponding flat surface does not have a cyclic Veech group. In addition, we prove that this Teichmueller disc is dense inside the hyperelliptic lo…
Proposes a new method for ensembling neural subnetworks.
problem Computational expense and limited flexibility of traditional deep ensembles.
method Sequential Bayesian neural subnetwork ensembling.
result Outperforms traditional ensembles in various metrics.
Generic Hitchin representations generate dense subgroups.
problem Understanding dense subgroups in SL_n(R) representations.
method Using a theorem by Rapinchuk, Benyash-Krivetz, and Chernousov.
result Generic Hitchin representations are strongly dense.
A model of associative memory is studied, which stores and reliably retrieves many more patterns than the number of neurons in the network. We propose a simple duality between this dense associative memory and neural networks commonly used in deep learning. On the associative memory side of this duality, a family of mo…
New lattices in higher dimensions have dense surface subgroups.
problem Finding dense subgroups in higher-dimensional arithmetic lattices.
method Exhibited nonuniform arithmetic lattices in SO(n,1).
result Contain Zariski-dense surface subgroups.
We discuss dense embeddings of surface groups and fully residually free groups in topological groups. We show that a compact topological group contains a nonabelian dense free group of finite rank if and only if it contains a dense surface group. Also, we obtain a characterization of those Lie groups which admit a dens…
PARMESAN learns from memory without parameters for fast, efficient continual learning.
problem Inflexibility in deep learning methods for continual learning.
method Transductive reasoning and memory search for parameter-free learning.
result 3-4 orders of magnitude faster than baselines, comparable performance.
In translation surfaces of finite area (corresponding to holomorphic differentials), directions of saddle connections are dense in the unit circle. On the contrary, saddle connections are fewer in translation surfaces with poles (corresponding to meromorphic differentials). The Cantor-Bendixson rank of their set of dir…
Bi-Lipschitz rigidity theorem for dense subgroups of algebraic groups.
problem Characterizing dense subgroups of algebraic groups.
method Bi-Lipschitz rigidity theorem for Zariski dense discrete subgroups.
result No C1-smooth slim limit set for higher rank semisimple algebraic groups. 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 study finds conditions for certain groups to be dense in a specific mathematical space.
problem Conditions for linear reflection groups to be dense in a projective space.
method Analyzes necessary and sufficient conditions for Zariski-density, applies to Coxeter groups and surface subgroups.
result Establishes conditions for Zariski-dense subgroups in SLn(Z) for various n. Given a compact polarized Kähler manifold X↪CPN, the space of Bergman metrics on X, parameterized by SL(N+1,C), corresponds to a dense set in the space of Kähler potentials in the Kähler class as N→∞. Critical points of the kth K-energy functional, which is def…
In this paper we consider the problem of pricing a perpetual American put option in an exponential regime-switching Lévy model. For the case of the (dense) class of phase-type jumps and finitely many regimes we derive an explicit expression for the value function. The solution of the corresponding first passage problem…
New representations of hyperbolic 3-manifold groups into larger groups.
problem Finding representations of hyperbolic 3-manifold groups into larger matrix groups.
method Holonomy representations from projective deformations of hyperbolic structures.
result First examples of strongly dense representations into SL(4,R) and SU(3,1). Dense neural networks can't approximate all functions.
problem Approximation capabilities of dense neural networks.
method Model compression approach combining weak regularity lemma and graph neural networks.
result Existence of Lipschitz continuous functions not approximable by dense neural networks.
Counting spheres in hyperbolic space with effective methods.
problem Counting spheres in Apollonian and Kleinian packings.
method Spectral methods and orbit counting, extending Kontorovich and Lax-Phillips techniques.
result Best-known effective error rate for sphere packing counting problems.
S2KAN integrates symbolic primitives into neural network activations for improved interpretability.
problem Training activations in KANs often lack symbolic fidelity, leading to unintelligible models.
method Softly Symbolified Kolmogorov-Arnold Networks (S2KAN) integrates symbolic primitives into training with learnable gates and a Minimum Description Length objective.
result S2KAN discovers interpretable forms when symbolic terms suffice, gracefully degrading to dense splines when necessary.
The study examines growth of quadratic forms under Anosov subgroups.
problem Growth of quadratic forms under Anosov subgroups.
method Analyzes exponential bounds and asymptotic counting functions for distances between geodesic copies of symmetric spaces.
result Shows asymptotic behavior of counting functions for certain choices of quadratic forms.
Odd-dimensional SL(n,Q) contains dense surface subgroups.
problem Finding dense subgroups in SL(n,Q) for odd n.
method Constructing a continuous path of representations.
result Existence of dense surface subgroups in SL(n,Q) for odd n.
Classifies manifolds with dense conjugacy classes in their mapping class groups.
problem Classifying manifolds based on conjugacy classes in their mapping class groups.
method Analyzing connected orientable 2-manifolds and their mapping class groups.
result Mapping class groups of certain manifolds have dense conjugacy classes.
We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erdős-Rényi random graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. For seeded problems, our result pr…
The paper finds dense subgroups in certain Lie groups.
problem Finding dense subgroups in Lie groups.
method Constructing dense surface subgroups in specific Lie groups.
result Uniform lattices contain infinitely many dense Hitchin representations.
New examples of rigid Lie foliations with dense leaves found.
problem Infinitesimal rigidity of Lie foliations with dense leaves.
method Construction of specific Lie foliations.
result First examples of infinitesimally rigid Riemannian foliations with dense leaves.
New analysis tightens memory capacity of Hopfield models using spherical codes.
problem Optimizing memory capacity in modern Hopfield models and Kernelized Hopfield Models.
method Connecting Hopfield models to spherical codes in information theory, establishing an optimal capacity bound and a sub-linear algorithm.
result First tight and optimal asymptotic memory capacity for modern Hopfield models, matching known lower bounds.
We prove that the bijective correspondence between the space of bounded measured laminations MLb(H) and the universal Teichmüller space T(H) given by λ↦Eλ∣S1 is a homeomorphism for the Fréchet topology on MLb(H) and the Teichmüller topology on T(H), where $E^λ…
Spatio-temporal (ST) data, which represent multiple time series data corresponding to different spatial locations, are ubiquitous in real-world dynamic systems, such as air quality readings. Forecasting over ST data is of great importance but challenging as it is affected by many complex factors, including spatial char…
Sharp boundaries for detecting dense subhypergraphs established.
problem Detecting dense subhypergraphs in random hypergraphs.
method Established sharp detection boundaries for known and unknown edge probabilities.
result Sharp detectable regions differ significantly from graph counterparts.