20 results for “HodgePhaseNet”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
HodgePhaseNet introduces a new representation for semantic transitions as an antisymmetric real-valued 1-cochain on a finite oriented simplicial complex.
The paper introduces a computational framework using Hodge zero-modes to track the geometry of topological features in parameter-dependent data, providing metrics like curvature and holonomy to quanti…
This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.
The paper introduces JupOtter, a bug detection system for Jupyter Notebooks with three contributions: notebook-specific tokenization, cell-level bug prediction, and a labeled dataset called OtterDatas…
The paper proposes a language called Grassmann that bridges coordinate-independent linear algebra and coordinate-dependent implementations.
This paper proposes a method to construct quiet planting distributions for k-SAT formulas with an arbitrary number of solutions.
The paper introduces DeclineCraft, a dynamic abstention benchmark to evaluate models' ability to recognize when they lack knowledge.
This paper performs a computational stylometric analysis of the Tipitaka across all three Pitakas in English translation.
This paper introduces a novel method for inferring relations in graphs using holonomy attention, which outperforms existing methods on certain tasks.
Zitian Gao, Yilong Chen, Yihao Xiao, Xinyu Yang +3 more
The paper introduces Loopie, two Mixture-of-Experts models that outperform vanilla Transformer baselines in looped Transformers, with extensive ablation studies and a strong reasoning pipeline.
This paper introduces a new invariant that distinguishes prime alternating knots using the Alexander-Briggs code.
Petr Pálka, Jiangyu Han, Prachi Singh, Marc Delcroix +2 more
SphereVBx improves clustering accuracy in diarization pipelines
The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…
This paper introduces new algorithms for finding prime numbers up to a given bound, achieving a speedup of log N over the sieve of Eratosthenes.
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.