ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “long thetas”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGstat.MLTheoreticalRecentJun 9, 2026

Limitations of Learning Tanh Neural Networks with Finite Precision

Philipp Grohs, Matěj Trödler

This paper investigates limitations of learning tanh neural networks under finite-precision computations and Lp accuracy guarantees.

View →
cs.DMmath.NTTheoreticalRecentJul 16, 2026

Conjectural Decidability of the Skolem Problem

Florian Luca, Joël Ouaknine, James Worrell

This paper introduces the concept of 'large' zeros in linear recurrence sequences and establishes that they either do not exist or are very sparse, which could lead to decidability of the Skolem Probl…

View →
cs.AIcs.HCcs.LGRecentMay 27, 2026

CaMBRAIN: Real-time, Continuous EEG Inference with Causal State Space Models

Abhilash Durgam, Nyle Siddiqui, Jeffrey A. Chan-Santiago, Qiushi Fu +2 more

CaMBRAIN introduces a novel Mamba-based State Space Model (SSM) for real-time, continuous EEG inference, achieving state-of-the-art results with significantly higher throughput than existing methods.

View →
cs.CLcs.AIRecentMay 27, 2026

Periodic RoPE for Infinite Context LLMs

Simin Huo

The paper proposes Periodic RoPE (P-RoPE) combined with a dual-layer attention mechanism to overcome the positional encoding limitations of LLMs, enabling theoretically infinite context understanding.

View →
cs.AIRecentMay 28, 2026

Diagnosing Harmful Continuation in Answer-Correct Long-CoT Training Traces

Chen He, Yuhao Wu, Lei Wang, Wenxuan Zhang +1 more

The paper identifies and demonstrates that post-conclusion continuation in answer-correct long-CoT traces is harmful during LLM fine-tuning, proposing a method to cut this continuation.

View →
cs.LGcs.AIRecentMay 28, 2026

HARP: Hadamard-Preconditioned Adaptive Rotation Processor for Extreme LLM Quantization

Artur Zagitov, Gleb Molodtsov, Aleksandr Beznosikov

HARP introduces a novel, adaptive, learnable orthogonal processor that significantly improves the robustness and accuracy of extreme low-bit LLM quantization compared to fixed methods.

View →
cs.CLRecentMay 31, 2026

LongAttnComp: Cross-Family Context Compression for Long-Context Reasoning

Mengmeng Ji, Ravi Shanker Raju, Jonathan Lingjie Li, Chen Wu

LongAttnComp introduces a novel, two-stage fine-tuning framework for context compression that significantly improves long-context reasoning performance, matching or exceeding full-context accuracy on…

View →
cs.FLcs.DScs.LGEmpiricalRecentJul 19, 2026

Stringological sequence prediction II: Right-to-left automaticity and related complexity measures

Vanessa Kosoy

This paper presents an efficient algorithm for right-to-left sequence prediction based on a new complexity measure called arithmetic repetition complexity, and demonstrates its application to predicti…

View →
cs.DScs.CRmath.NTRecentMay 17, 2026

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice

Ming-Xing Luo

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

View →
cs.SDcs.AIEmpiricalRecentJul 22, 2026

RPPNet: Perceptually-Grouped Rhythm-Pitch Primitives for Long-Term Structure Melody Generation via Boundary-Aware Modeling

Tieyao Zhang, Yuke Liu, Jiaxing Yu, Xinda Wu +2 more

This paper proposes RPPNet, a two-stage deep learning architecture for music generation with variable structural boundaries, which automatically derives grouping of Rhythm-Pitch Primitive sequences fr…

View →
cs.DSEmpiricalRecentJun 21, 2026

Modular Rank and Linear-Complexity Tests for Pseudorandom Number Generators

Sebastiano Vigna

The paper introduces a modular version of rank and linear-complexity tests for pseudorandom number generators and provides a Rust program, modlin, to detect statistical bias in generators that are lin…

View →
cs.LGEmpiricalRecentJul 8, 2026

How Data Shapes RoPE Frequency Usage: From Positional Scale Matching to Length Generalization

Xinyi Wu, Siyuan Liu, Ali Jadbabaie

This paper explains how Rotary Position Embeddings (RoPE) frequencies in transformer models correspond to the relative-distance structure of training data, and the implications for long-context genera…

View →
cs.LGcs.AIcs.CVRecentMay 31, 2026

BRo-JEPA: Learning Modular Arithmetic in Latent Space

Divyansh Jha, Yuanfang Xie, Varan Mehra, Brennen Yu

The paper introduces BRo-JEPA, a latent world model that successfully learns modular arithmetic (like addition modulo 10) by explicitly imposing the circular structure of the problem into the latent s…

View →
cs.AIcs.LGRecentMay 30, 2026

SHARP: Sleep-based Hierarchical Accelerated Replay for Long Range Non-Stationary Temporal Pattern Recognition

Jayanta Dey, Shikhar Srivastava, Itamar Lerner, Christopher Kanan +1 more

SHARP proposes a novel sleep-based hierarchical replay framework to efficiently learn long-range non-stationary temporal patterns in streaming data, achieving improved context retention and predictive…

View →
cs.LGcs.CLeess.SPRecentMay 31, 2026

Beyond Sinusoids: A Morlet Wavelet Framework for Transformer Positional Encoding

Athanasios Zeris

The paper introduces Morlet Positional Encoding (MoPE), a novel wavelet-based positional encoding that models position and locality simultaneously, outperforming standard sinusoidal and RoPE methods.

View →
cs.DSEmpiricalRecentJun 12, 2026

On a Conjecture for Parameterized st-Orientations

Charalampos Papamanthou

This paper disproves a conjecture about the longest-path lengths of MaxSTN and MinSTN algorithms for producing $st$-orientations of biconnected graphs.

View →
math.NTcs.CRcs.DSTheoreticalRecentJul 3, 2026

Calculating the floor of y**(1/m)

Alexandros V. Gerbessiotis

This paper presents two algorithms using the Newton-Raphson method to calculate the floor of y**(1/m) for natural integer numbers y > 2 and m > 1, which can be used to determine if y is an integer pow…

View →
cs.PLcs.CCcs.DBRecentJun 1, 2026

From Time to Space: The Impact of Linearity in Higher-Order Datalog

Angelos Charalambidis, Babis Kostopoulos, Panos Rondogiannis

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

View →
cs.CRcs.FLcs.MSRecentMar 20, 2026

Cellular Automata based Resource Efficient Maximally Equidistributed Pseudo-Random Number Generators

Bhuvaneswari A, Kamalika Bhattacharjee

The paper proposes a novel set of combined cellular automaton (CA)-based pseudo-random number generators (PRNGs) that overcome the weak equidistribution issues of existing CA-based PRNGs, achieving ma…

View →