Counting tripods on a flat torus using lattice point counting.
problem Counting finite BPS webs in flat torus geometry.
method Lattice point counting techniques in .
result Asymptotic counting result for tripods on the torus.
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
48 results for “Counting Problems”
Neuro# learns heuristics to speed up #SAT solvers.
problem Efficiently solving #SAT problems for large industrial instances.
method Learning branching heuristics to improve #SAT solver performance.
result Neuro# reduces step count and wall-clock time on diverse problem families.
For a geometrically finite group Gamma of G=SO(n,1), we survey recent developments on counting and equidistribution problems for orbits of Gamma in a homogeneous space H\G where H is trivial, symmetric or horospherical. Main applications are found in an affine sieve on orbits of thin groups as well as in sphere countin…
The paper counts mapping classes by Nielsen-Thurston type, finding growth rates for different subsets.
problem Counting mapping classes in Teichmüller space with different subsets.
method Introduced complexity length to measure negative curvature of curve complexes.
result Growth rates for finite-order, reducible, and multitwists subsets.
We study the combinatorial geometry of "lattice" Jenkins--Strebel differentials with simple zeroes and simple poles on and of the corresponding counting functions. Developing the results of M. Kontsevich we evaluate the leading term of the symmetric polynomial counting the number of such "lattice" Jenki…
Counting curves on surfacesmath.GT
In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface , and fix a number of points on its boundary. We ask: how many configurations of disjoint arcs are there on whose boundary is ? We find that thi…
We consider an agent's uncertainty about its environment and the problem of generalizing this uncertainty across observations. Specifically, we focus on the problem of exploration in non-tabular reinforcement learning. Drawing inspiration from the intrinsic motivation literature, we use density models to measure uncert…
Counted essential surfaces in a knot's exterior, finding a unique pattern.
problem Counting essential surfaces in a knot's exterior.
method Counted essential surfaces by genus, using Euler totient function. Showed normal surfaces are connected by counting their components. Used Agol, Hass, and Thurston's tools to convert component counting into orbit counting.
result Found a unique pattern in the number of essential surfaces by genus.
Better neural arithmetic logic units improve cell counting model generalization.
problem Neural networks struggle with high cell counts outside training data range.
method Introduced Neural Arithmetic Logic Units (NALU) for arithmetic operations in existing architectures.
result Improved cell counting accuracy for higher numeric ranges with better generalization.
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.
In this paper, we study a new graph learning problem: learning to count subgraph isomorphisms. Different from other traditional graph learning problems such as node classification and link prediction, subgraph isomorphism counting is NP-complete and requires more global inference to oversee the whole graph. To make it …
Counting objects in digital images is a process that should be replaced by machines. This tedious task is time consuming and prone to errors due to fatigue of human annotators. The goal is to have a system that takes as input an image and returns a count of the objects inside and justification for the prediction in the…
Algorithm counts intersections of normal curves efficiently.
problem Efficiently solving word problems in mapping class groups of punctured surfaces.
method Fast algorithm for counting intersections of normal curves on triangulated surfaces.
result Efficient solution of the word problem for mapping class groups of punctured surfaces.
Counting the number of clusters, when these clusters overlap significantly is a challenging problem in machine learning. We argue that a purely mathematical quantum theory, formulated using the path integral technique, when applied to non-physics modeling leads to non-physics quantum theories that are statistical in na…
The ability to detect and count certain substructures in graphs is important for solving many tasks on graph-structured data, especially in the contexts of computational chemistry and biology as well as social network analysis. Inspired by this, we propose to study the expressive power of graph neural networks (GNNs) v…
In this paper we study the equidistribution of expanding horospheres in infinite volume geometrically finite rank one locally symmetric manifolds and apply it to the orbital counting problem in apollonian sphere packing.
Multivariate count data are defined as the number of items of different categories issued from sampling within a population, which individuals are grouped into categories. The analysis of multivariate count data is a recurrent and crucial issue in numerous modelling problems, particularly in the fields of biology and e…
Polynomial-time methods count and sample DAGs from equivalence classes.
problem Counting and sampling DAGs from Markov equivalence classes.
method Polynomial-time algorithms for DAGs.
result Counting and sampling can be done in polynomial time.
Graphical estimation of count time series dependencies.
problem Estimating dependencies between multivariate count time series.
method Parameter-driven generalized linear model with l1-type regularization and MCEM algorithm.
result Characterization of disease spread interdependence and sources/sinks in Greater Mumbai.
odeN efficiently approximates multiple temporal motifs in large networks.
problem Efficiently counting multiple temporal motifs in large temporal networks.
method odeN is a sampling-based algorithm that provides accurate probabilistic approximations of motif counts.
result odeN provides accurate approximations of motif counts in a fraction of the time needed by state-of-the-art methods.
Complexity of counting group homomorphisms depends on group structure and presentation.
problem Computing the number of homomorphisms from a group to another.
method Obstruction theory and polynomial time algorithms for specific cases.
result Efficient algorithms for counting homomorphisms under certain conditions.
The Poincare function is a compact form of counting moduli in local geometric problems. We discuss its property in relation to V.Arnold's conjecture, and derive this conjecture in the case when the pseudogroup acts algebraically and transitively on the base. Then we survey the known counting results for differential in…
We present the first framework for Gaussian-process-modulated Poisson processes when the temporal data appear in the form of panel counts. Panel count data frequently arise when experimental subjects are observed only at discrete time points and only the numbers of occurrences of the events between subsequent observati…
Flow Matching for Count Datastat.ML
Flow Matching for count data improves sample quality and efficiency.
problem Mapping between count distributions across batches or time points in high-dimensional count data.
method count-FM, a flow-matching framework based on a continuous-time birth-death process with local unit jumps.
result count-FM achieves better sample quality than representative baselines while using fewer parameters.
Identifiability of Contagion Components amid Environmental Fluctuations in Aggregated Default Countsq-fin.RM
Study identifies contagion in aggregated defaults despite environmental changes.
problem Identify contagion in aggregated default counts with fluctuating probabilities.
method Compare three contagion mechanisms (Davis-Lo, Torri, Vasicek) under i.i.d. and hierarchical specifications.
result Threshold contagion is largely absorbed into environmental heterogeneity, while cumulative contagion leaves a persistent signature.
We count meromorphic differentials with fixed residues and poles of fixed orders.
problem Counting meromorphic differentials with fixed residues and poles of fixed orders.
method Intersection theory on compactified moduli spaces of differentials.
result Complete solution to the problem with interesting combinatorial properties.
Study counts geodesics on modular surface, linking to necklace counting.
problem Counting geodesics on modular surface with specific winding numbers.
method Asymptotic expansion, generating function analysis, correspondence to necklace counting.
result Obtained asymptotic growth rate of m low-lying geodesics in terms of word length.
Estimates the number of closed curves on surfaces with power-saving error terms.
problem Counting closed curves on surfaces with given properties.
method Effective dynamics of mapping class group on Teichmüller space and space of closed curves, introducing novel methods.
result Proves estimates with power-saving error terms for filling closed curves and curves with respect to a current.
From social science to biology, numerous applications often rely on graphlets for intuitive and meaningful characterization of networks at both the global macro-level as well as the local micro-level. While graphlets have witnessed a tremendous success and impact in a variety of domains, there has yet to be a fast and …
Intersection theory of coassociative submanifolds in G_(2)-manifolds and Seiberg-Witten invariantsmath.DG
We study the problem of counting instantons with coassociative boundary condition in (almost) G_(2)-manifolds. This is analog to the open Gromov-Witten theory for counting holomorphic curves with Lagrangian boundary condition in Calabi-Yau manifolds. We explain its relationship with the Seiberg-Witten invariants for co…
BPNNs learn to solve combinatorial problems faster and more accurately.
problem Generalizing belief propagation for efficient problem solving.
method BPNNs are parameterized operators that operate on factor graphs, generalizing BP. BPNN-D is a learned iterative operator that provably maintains BP's properties.
result BPNN-D converges 1.7x faster on Ising models and provides tighter bounds.
The partial uniform ellipticity and prescribed problems on the conformal classes of complete metricsmath.DG
Solves nonlinear problems on metric structures through eigenvalue counting.
problem Nonlinear equations on metric structures
method Counting large eigenvalues of linearized operators
result Solves fully nonlinear Loewner-Nirenberg and Yamabe problems
This work refines Cover's theory for binary classification on low-dimensional data.
problem The challenge of analyzing how low-dimensional data structures affect classification models.
method Refines Cover's function-counting theory to account for low-dimensional data structure.
result Derives dichotomy counts and analyzes the impact of data structure on classification models.
Study counts geodesic surfaces in knot complements, finding unique ones for small knots.
problem Counting totally geodesic surfaces in knot complements.
method Adapting boundary slope and intersection techniques, extending obstructions.
result Uniqueness of geodesic surfaces for specific knots, no geodesic surfaces for 47 knots.
Counting curves on orbifoldsmath.GT
New theorem counts curves on orbifolds.
problem Counting curves on surfaces.
method Applied Mirzakhani's theorem to orbifolds.
result Curve counting theorem extends to orbifolds.
Counting essential surfaces in 3-manifolds yields concise formulae and detailed asymptotics.
problem Counting isotopy classes of essential surfaces in 3-manifolds.
method Normal and almost normal surfaces, Ehrhart's lattice point counting, ideal triangulations, and new essential surface testing.
result Quasi-polynomial behavior of surface counts and concise formulae for surface numbers.
Polynomial-time methods count and sample DAGs from Markov classes.
problem Counting and sampling Markov equivalent DAGs.
method Polynomial-time algorithms for DAGs from Markov classes.
result Long-standing open problem solved, making practical infeasible strategies feasible.
New surgery exact triangles in Heegaard Floer homology for rational slopes.
problem Constructing new surgery exact triangles in Heegaard Floer homology.
method Combining combinatorial triangle and quadrilateral counting in genus 1 Heegaard diagrams.
result Solving the combinatorial problem for rational slopes, including tricky cases.
A new method, Count-MORL, improves offline reinforcement learning by using state-action frequency.
problem Improving offline reinforcement learning performance.
method Integrates count-based conservatism into model-based offline reinforcement learning.
result The learned policy is near-optimal and outperforms existing methods.
A Study of the Learnability of Relational Properties: Model Counting Meets Machine Learning (MCML)cs.LG
This paper introduces the MCML approach for empirically studying the learnability of relational properties that can be expressed in the well-known software design language Alloy. A key novelty of MCML is quantification of the performance of and semantic differences among trained machine learning (ML) models, specifical…
Proposes a method to reconcile count time series forecasts.
problem No formal framework for probabilistic reconciliation of count time series.
method Generalizes Bayes' rule for reconciling real-valued and count variables.
result Improves forecast accuracy for count variables compared to Gaussian reconciliation.
In this paper, a taxonomy for memory networks is proposed based on their memory organization. The taxonomy includes all the popular memory networks: vanilla recurrent neural network (RNN), long short term memory (LSTM ), neural stack and neural Turing machine and their variants. The taxonomy puts all these networks und…
Algorithm recovers permutations of high-dimensional Gaussian vectors with constant correlation.
problem Recovering permutations of high-dimensional Gaussian vectors with constant correlation.
method Computing and comparing weighted counts of specially chosen wide trees.
result Polynomial-time algorithm for exact recovery at constant correlation.
Automatically counts microglial cells in rat spinal cord images, providing precise counts and uncertainty estimates.
problem Counting microglial cells in small, heterogeneous datasets is time-consuming and requires extensive training.
method Pre-processing to filter images, designing a non-parametric, non-linear kernel counter, providing uncertainty estimation.
result The method can provide precise counts and uncertainty estimates in small datasets, even with expert opinions.
Study geodesic paths on flat surfaces, comparing length and singularity counts.
problem Comparing geometric length and singularity counts on geodesic paths.
method Apply counting limit laws to infinite graphs and then to flat surfaces.
result Statistical comparison of geometric length and singularity counts on geodesic paths.
For every positive, continuous and homogeneous function on the space of currents on a compact surface , and for every compactly supported filling current , we compute as , the number of mapping classes so that . As an application, when the surface in question is close…
Counts arcs in surfaces, proving convergence of geodesic currents.
problem Counting arcs of the same type in compact surfaces and related geometries.
method Derives convergence of geodesic currents to prove arc counts.
result Proves convergence of geodesic currents, leading to arc counting results.
Deviance-style normalization for sparse, jointly overdispersed count matrices
problem Jointly overdispersed count matrices
method Dirichlet-multinomial deviance residualization
result Preserves exact sparsity, evaluates in constant time, recovers multinomial residual