Marked Graph Mosaicsmath.GT
Enhances knot counting using mosaic diagrams.
problem Counting and classifying surface-links and knots.
method Marked graph diagrams and mosaic numbers.
result Established bounds on mosaic numbers for surface-links.
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,742 papers · 148 categories
Trend · papers per month
48 results for “kei counting”
We define invariants of unoriented knots and links by enhancing the integral kei counting invariant Phi_X^Z (K) for a finite kei X using representations of the kei algebra, Z_K[X], a quotient of the quandle algebra Z[X] defined by Andruskiewitsch and Grana. We give an example that demonstrates that the enhanced invaria…
Researchers calculate complexity of billiard paths in regular polygons.
problem Calculating the complexity of billiard paths in regular polygons.
method Counting saddle connections on lattice surfaces, focusing on combinatorial length.
result They answered a question about billiard language complexity in regular polygons.
Novel Bayesian method for high-dimensional count data prediction.
problem Count data in high-dimensional settings requires feature selection.
method Pseudo-Bayesian framework with scaled Student prior and exponential weights.
result Strong performance compared to Lasso in various settings.
We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group Γ, which generalizes a formula of Gäschutz. Key to this approach are the degree 1 and 2 cohomology groups of G, with certain twisted coefficients. As an application, we count low-index subgroups of …
BeBold improves exploration in sparse-reward tasks by regulating visitation counts.
problem Efficient exploration in deep reinforcement learning under sparse rewards.
method Regulated difference of inverse visitation counts.
result BeBold solves 12 challenging tasks in MiniGrid with fewer steps than previous state-of-the-art.
New tree-structured Markov fields with Poisson marginals for counting variables.
problem Counting variables with complex dependencies.
method Tree-structured Markov random fields with Poisson marginals.
result Straightforward sampling and joint probability calculations.
New method counts boundary pieces in ReLU classifiers for better complexity measure.
problem Current classification complexity measures are misleading and ineffective.
method Developed a novel method using tropical geometry to count exact boundary pieces.
result Boundary piece count is negatively correlated with robustness.
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.
We define a family of probability distributions for random count matrices with a potentially unbounded number of rows and columns. The three distributions we consider are derived from the gamma-Poisson, gamma-negative binomial, and beta-negative binomial processes. Because the models lead to closed-form Gibbs sampling …
Precision medicine aims for personalized prognosis and therapeutics by utilizing recent genome-scale high-throughput profiling techniques, including next-generation sequencing (NGS). However, translating NGS data faces several challenges. First, NGS count data are often overdispersed, requiring appropriate modeling. Se…
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…
Manual count of mitotic figures, which is determined in the tumor region with the highest mitotic activity, is a key parameter of most tumor grading schemes. It can be, however, strongly dependent on the area selection due to uneven mitotic figure distribution in the tumor section.We aimed to assess the question, how s…
Fenrir efficiently estimates Bayesian MLN-DLMs for scalable inference.
problem Computational challenges in Bayesian MLN-DLMs for longitudinal count compositional data.
method Novel algorithm for MAP estimation and accurate posterior marginal approximation.
result Fenrir can be three orders of magnitude more efficient than Stan.
FetchSGD reduces communication in federated learning with sketching.
problem Communication bottlenecks and convergence issues in federated learning.
method FetchSGD uses Count Sketch to compress and merge model updates efficiently.
result FetchSGD achieves high compression rates and good convergence without sparse client participation.
Discrete Gaussian noise preserves privacy and accuracy in differential privacy.
problem Finite computers cannot represent continuous Gaussian noise, leading to privacy breaches and loss of interpretability.
method Introduced and analyzed discrete Gaussian noise, providing privacy and accuracy guarantees similar to continuous Gaussian noise.
result Discrete Gaussian noise offers the same privacy and accuracy as continuous Gaussian noise, with efficient sampling algorithms.
Inferring Microbial Biomass Yield and Cell Weight using Probabilistic Macrochemical Modelingq-bio.QM
Method improves microbial biomass yield estimation from noisy data.
problem Estimating microbial biomass yields from noisy cell counts and substrate measurements.
method Probabilistic macrochemical modeling to relax cell weight assumptions and improve robustness.
result Model provides accurate uncertainty estimates of key parameters.
We study the problem of online path learning with non-additive gains, which is a central problem appearing in several applications, including ensemble structured prediction. We present new online algorithms for path learning with non-additive count-based gains for the three settings of full information, semi-bandit and…
Poisson Hierarchical Indian Buffet Processes-With Indications for Microbiome Species Sampling Modelsstat.ML
PHIBP models complex microbiome data with shared parameters.
problem Complex, sparse count data in microbiome analysis.
method Bayesian nonparametric framework with shared species parameters.
result Flexible multivariate count model with tractable inference.
Study counts surface subgroups in curved 3D manifolds.
problem Count surface subgroups in curved 3D manifolds.
method Solve foliated Plateau problem in Cartan-Hadamard manifolds.
result Prove rigidity for lower bound on surface subgroup count.
Continuous vector representations of words and objects appear to carry surprisingly rich semantic content. In this paper, we advance both the conceptual and theoretical understanding of word embeddings in three ways. First, we ground embeddings in semantic spaces studied in cognitive-psychometric literature and introdu…
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.
Crowd counting problem aims to count the number of objects within an image or a frame in the videos and is usually solved by estimating the density map generated from the object location annotations. The values in the density map, by nature, take two possible states: zero indicating no object around, a non-zero value i…
Adjusted for chance measures are widely used to compare partitions/clusterings of the same data set. In particular, the Adjusted Rand Index (ARI) based on pair-counting, and the Adjusted Mutual Information (AMI) based on Shannon information theory are very popular in the clustering community. Nonetheless it is an open …
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.
We study minimal harmonic maps , parameterized by polynomial cubic differentials in the plane. The asymptotic structure of such a is determined by a convex polygon in . We give a conjectural method for determining by solving…
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.
In this paper, we develop a new approach to learning high-dimensional Poisson directed acyclic graphical (DAG) models from only observational data without strong assumptions such as faithfulness and strong sparsity. A key component of our method is to decouple the ordering estimation or parent search where the problems…
FedSKETCH and FedSKETCHGATE improve privacy and efficiency in federated learning.
problem Communication and privacy challenges in federated learning.
method Compression of local gradients using count sketch to protect privacy and reduce communication.
result Sharp convergence guarantees and experimental validation of the methods.
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.
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.
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.
Graph neural networks struggle with counting certain substructures in graphs.
problem Detecting and counting specific substructures in graphs.
method Study of graph neural networks' ability to count attributed graph substructures.
result Graph neural networks like MPNNs, 2-WL, and 2-IGNs have limitations in counting certain substructures.
Structured high-cardinality data arises in many domains, and poses a major challenge for both modeling and inference. Graphical models are a popular approach to modeling structured data but they are unsuitable for high-cardinality variables. The count-min (CM) sketch is a popular approach to estimating probabilities in…
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
Hierarchical Count Echo State Network Models with Application to Graduate Student Enrollmentsstat.ME
The paper proposes count echo state networks for forecasting graduate student enrollments.
problem Forecasting graduate student enrollments from historical data.
method Developed hierarchical count echo state networks and compared them to Poisson autoregressions and negative binomial models.
result Hierarchical negative binomial based echo state network is the superior model.
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.
The abstract reviews models for analyzing count data.
problem Challenges in analyzing count data with standard methods.
method Review of generalized linear models and multinomial models.
result Fundamental connections between multinomial and count models.
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…
The study bounds invariants of PL manifolds and counts complexity of lens spaces.
problem Bounding invariants of PL manifolds and understanding their complexity.
method Using -colored polyhedra and relative hyperbolization, the study constructs cobordisms with linear complexity.
result Linear bounds on Wall -invariants and Cheeger-Gromov -invariants of PL manifolds.
Proposes a robust EM algorithm for analyzing incomplete panel count data.
problem Missing reports in panel count data.
method Functional EM algorithm for non-parametric counting process mean function estimation.
result Robust to misspecification of Poisson process assumption and missing completely at random.
Given a finitely-generated group G, and a finite group Γ, Philip Hall defined δ_Γto be the number of factor groups of G that are isomorphic to Γ. We show how to compute the Hall invariants by cohomological and combinatorial methods, when G is finitely-presented, and Γbelongs to a certain class of metabelian groups. Key…
Calegari, Marques, and Neves count minimal surfaces in hyperbolic manifolds.
problem Counting minimal surfaces in hyperbolic manifolds.
method Using a laminar measure concept.
result An idea of a proof for counting minimal surfaces.
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.
Counts minimal tori in Riemannian manifolds with 6 or more dimensions.
problem Counting minimal tori in Riemannian manifolds.
method Introduces a function to count minimal tori and shows invariance under metric perturbations.
result The count function is invariant under metric perturbations.
Black holes offer insights into machine learning's loss landscapes.
problem Understanding the loss landscape in machine learning.
method Comparing machine learning loss landscapes to black hole entropy.
result Black holes provide an infinite family of potential landscapes with known minima.
In recent scene recognition research images or large image regions are often represented as disorganized "bags" of features which can then be analyzed using models originally developed to capture co-variation of word counts in text. However, image feature counts are likely to be constrained in different ways than word …