CROP verifies clean prefixes in reasoning traces, improving downstream repair accuracy.
problem Uncertainty in reasoning traces prevents full certification of entire responses.
method CROP selects a calibrated threshold to certify the longest prefix with low risk proxies.
result CROP improves downstream repair accuracy by preserving valid reasoning and discarding misleading suffixes.
Hybrid framework injects TSLM insights into GRLM for robust time-series reasoning.
problem Lack of domain-specific knowledge in large language models for time-series reasoning.
method Hybrid knowledge-injection framework combining RLVR for efficient knowledge transfer.
result Consistently outperforms existing models by 7.9%-26.1% on multivariate time-series benchmarks.
A new method for math reasoning that allows for iterative correction.
problem Standard reasoning models commit to each token and cannot recover from early errors.
method Generative framework with latent thought vectors for iterative self-correction.
result 30 rethinking iterations surpass baselines with 15 times more parameters.
Proposes CLRS-Text, a new benchmark for evaluating LM reasoning capabilities.
problem Lack of transferable benchmarks for evaluating reasoning capabilities of language models.
method Developed a textual version of the CLRS benchmark, generating diverse algorithmic tasks.
result Demonstrates a novel challenge for the LM reasoning community and validates prior work.
Improved reasoning model by sampling from power distribution without additional training.
problem Efficiently sampling from a sharpened distribution to improve reasoning models.
method Entropy-Cut Metropolis-Hastings algorithm that identifies key decision points for resampling.
result The method consistently improves reasoning models across various datasets.
VTA combines verbal and latent reasoning for accurate stock time-series forecasts.
problem Challenges in combining textual analysis with time-series data for financial forecasting.
method Converts stock price data into textual annotations, optimizes reasoning trace using inverse MSE, conditions time-series model outputs on reasoning attributes.
result VTA achieves state-of-the-art forecasting accuracy and interpretable reasoning traces.
ConCuR generates high-quality CUDA kernels with concise reasoning traces.
problem Scarce high-quality data for kernel generation.
method Developed a pipeline to generate and curate high-quality CUDA kernels with reasoning traces.
result Our model achieves significant improvements in KernelBench setup.
Kernel smoothing improves LLM reasoning efficiency.
problem Efficiently estimate value functions with limited samples for reinforcement learning.
method Kernelized advantage estimation using classical nonparametric statistics.
result Improved policy optimization with accurate value and gradient estimation.
Prefix consistency improves model reliability by weighting answers based on their reproducibility.
problem Improving the reliability of large language models' reasoning traces.
method Use prefix consistency to weight candidate answers based on their reproducibility during regeneration.
result Prefix consistency is the best correctness predictor, reaching Standard MV plateau accuracy with up to 21x fewer tokens.
ManifoldMind uses adaptive-curvature probabilistic spheres for trustworthy recommendations in semantic hierarchies.
problem Sparse and abstract recommendation domains where users explore diverse conceptual paths.
method Adaptive-curvature probabilistic spheres, soft multi-hop inference, and curvature-aware semantic kernel.
result Superior NDCG, calibration, and diversity compared to baselines on public benchmarks.
Fractured Sampling improves LLM reasoning efficiency by truncating CoT trajectories.
problem Efficiently scaling reasoning in large language models with limited tokens.
method Integrating truncated Chain-of-Thought (CoT) with Fractured Sampling across multiple dimensions.
result Fractured Sampling achieves superior accuracy-cost trade-offs compared to full CoT.
Dynamic abstention improves LLM accuracy by selectively terminating unpromising reasoning.
problem LLMs waste compute on incorrect responses, leading to inefficiency.
method Formal reinforcement learning framework with abstention reward parameter.
result Dynamic abstention outperforms natural baselines in selective accuracy.
A conformal procedure improves CoT reasoning by aggregating reasoning paths and calibrating abstention rules.
problem Aggregation uncertainty in chain-of-thought reasoning makes correct answers less reliable.
method Introduces a conformal procedure for CoT reasoning that uses weighted score aggregation and abstention rules.
result Achieves higher selective accuracy with abstention, reducing confident-error rate.
Curriculum learning improves model training efficiency and performance.
problem Expensive training of reasoning models using human or synthetic data.
method Autocurriculum, where models use their own performance to decide training problems.
result Autocurriculum reduces training costs and improves model performance.
New adversarial examples with structured distortion sets improve robustness and perceptibility.
problem Improving adversarial robustness and perceptibility of images.
method Exploring and constraining adversarial search with trace-norms and other norms.
result Structured adversarial perturbations allow larger distortions and control over generation.
CLN2INV learns precise loop invariants from program traces.
problem Automated verification of real-world programs with complex loops.
method Continuous Logic Network (CLN) for learning precise loop invariants from program execution traces.
result CLN2INV significantly outperforms existing approaches on the Code2Inv dataset.
Next-gen reservoir computers fail to predict complex processes, highlighting need for better architectures.
problem Predicting complex, non-Markovian processes with recurrent neural networks.
method Lower bound from Fano's inequality and analysis of large probabilistic state machines.
result Next-generation reservoir computers have an error probability at least 60% higher than optimal for highly non-Markovian processes.
Automates hair color digitization using imaging and deep learning.
problem Challenges in capturing and rendering realistic hair colors.
method Combines imaging, path-tracing, and self-supervised machine learning.
result Accurately captures and renders hair color with synthetic images.
This is a continuation of our previous work arXiv:1601.05617 on trace and inverse trace of Steklov eigenvalues. More new inequalities for the trace and inverse trace of Steklov eigenvalues are obtained.
Thinking LLMs struggle with stock prediction, especially as data complexity increases.
problem Evaluating the performance of 'thinking' LLMs in stock prediction, especially under varying levels of cross-sectional complexity.
method Rolling 48m/1m walk-forward evaluation, comparing direct LLMs, TLLMs, and classical learners on cross-sectional ranking loss, MSE, and backtests with transaction costs.
result TLLMs' ranking quality deteriorates as cross-sectional complexity grows, while direct LLMs remain stable.
Study of torus surgeries on knot traces, finding exotic surfaces and traces.
problem Understanding exotic surfaces and traces through torus surgeries.
method Realizing annulus twisting as torus surgery, using key technical insight.
result Exotic elliptic surfaces and traces discovered, improving known geography.
Classifies knot traces with specific trisection genus limits.
problem Classifying knot traces with specific trisection genus limits.
method Classifying knot traces with specific trisection genus limits.
result Infinitely many knots have traces with trisection genus 3 and 4, and arbitrarily large trisection genus.
Guillemin trace formula adapted for group actions.
problem Distributional trace for proper, cocompact group actions.
method Developing an equivariant version of the distributional trace.
result Equivariant Guillemin trace formula for group actions.
Paper derives trace formula for magnetic Laplacian at zero energy.
problem Trace formula for magnetic Laplacian at zero energy.
method Generalizes Gutzwiller trace formula, focuses on zero energy level.
result Derives trace formula at zero energy level.
In this paper, we obtain some new estimates for the trace and inverse trace of Steklov eigenvalues. The estimates generalize some previous results of Hersch-Payne-Schiffer , Brock}, Raulot-Savo and Dittmar.
New methods derive a generalized Frenkel trace formula for Lie groups.
problem Deriving a generalized Frenkel trace formula for Lie groups.
method Applying supersymmetric localization to quantum mechanical and gauged sigma models.
result Presented two complementary approaches for the derivation of the trace formula.
Examines a new type of analytic torsion on Riemannian manifolds.
problem Analyzing a new trace formula for Riemannian manifolds.
method Uses residue-trace instead of spectral zeta function quasi-trace.
result Defines and examines the residue analytic torsion.
Derives Selberg trace formula on Riemann surfaces and generalizes to other spaces.
problem Deriving and generalizing the Selberg trace formula.
method Supersymmetric localization principle and path integral derivation.
result Derives Selberg trace formula on arbitrary compact Riemann surfaces and generic compact locally symmetric spaces.
Introduces a new model for mapping matrices to matrices, subsuming linear regression.
problem Learning matrix-to-matrix mappings from data.
method Partial trace regression model, leveraging quantum information theory.
result Relevance demonstrated in matrix-to-matrix regression and positive semidefinite matrix completion.
CausalSim corrects bias in trace-driven simulations for more accurate results.
problem Bias in trace-driven simulations due to system conditions during trace collection.
method CausalSim learns a causal model of system dynamics and latent factors from an RCT to remove bias from trace data.
result CausalSim reduces simulation errors by 53% and 61% compared to baselines, providing more accurate insights.
A cocycle Ω:P×G→H taking values in a Lie group H for a free right action of G on P defines a principal bundle Q with the structure group H over P/G. The Chern character of a vector bundle associated to Q defines then characteristic classes on X. This observation becomes useful in the case …
New findings on knots and their traces, distinguishing L-space knots by their 0-trace.
problem Characterizing knots by their traces and Dehn surgeries.
method Combining Heegaard Floer homology with surface homeomorphisms and dynamics.
result The 0-trace detects every L-space knot, contrasting with characterizing surgeries.
This paper investigates the strength of the trace field as a commensurability invariant of hyperbolic 3-manifolds. We construct an infinite family of two-component hyperbolic link complements which are pairwise incommensurable and have the same trace field, and infinitely many 1-cusped finite volume hyperbolic 3-manifo…
Clarifies a trace for Heisenberg operators on contact manifolds.
problem Calculating the index of Heisenberg elliptic operators on contact manifolds.
method Introduced a new trace on Heisenberg pseudodifferential operators and constructed a cocycle in periodic cyclic cohomology.
result Simplified the construction of the trace on Heisenberg pseudodifferential operators.
We give axioms which characterize the local Reidemeister trace for orientable differentiable manifolds. The local Reidemeister trace in fixed point theory is already known, and we provide both uniqueness and existence results for the local Reidemeister trace in coincidence theory.
Researchers compute trace formula for magnetic Laplacian on hyperbolic surfaces.
problem Analyzing the magnetic Laplacian on compact hyperbolic surfaces.
method Computed the trace formula for magnetic Laplacian energies above the Mane critical level.
result Asymptotic behavior of trace formula coefficients near the Mane critical level.
Sharp inequality found on three-balls for fourth order Sobolev traces.
problem Fourth order Sobolev trace inequality on three-balls.
method Established through equivalence to a third order Sobolev inequality on two-spheres.
result Sharp fourth order Sobolev trace inequality on three-balls.
Infinite knots have non-integer trace values.
problem Finding knots with non-integer trace values.
method Proved existence of infinitely many non-homeomorphic hyperbolic knot complements with specific trace properties.
result Infinitely many non-homeomorphic hyperbolic knot complements with non-integer trace values.
Introduces expected eligibility traces for more efficient credit assignment in reinforcement learning.
problem Efficiently assigning credit to states and actions in reinforcement learning.
method Introduces expected eligibility traces, allowing updates to counterfactual sequences.
result Substantial improvements in temporal-difference learning can be achieved with expected traces.
Quantum trace map defined for 3-manifolds with torus boundaries.
problem Quantifying topological structures of 3-manifolds with torus boundaries.
method Defining a quantum trace map from skein module to a quantum torus module.
result Established a 3D quantum trace map for 3-manifolds with torus boundaries.
New knots found that resist trace detection.
problem Knots not detected by any trace.
method Extended existing results to new knots.
result Knots exist that share traces with infinitely many distinct knots and are not detected by any trace.
We study new invariants of elliptic partial differential operators acting on sections of a vector bundle over a closed Riemannian manifold that we call the relativistic heat trace and the quantum heat traces. We obtain some reduction formulas expressing these new invariants in terms of some integral transforms of the u…
New hyperbolic manifolds found with same trace ring.
problem Finding non-commensurable hyperbolic manifolds with identical trace rings.
method Proved existence of infinitely many non-commensurable manifolds with same ambient group and trace ring.
result Infinitely many non-commensurable hyperbolic manifolds with the same ambient group and trace ring.
Sub-Riemannian Selberg trace formulae for compact quotients of SL(2, R)
problem Computing zeta-regularized determinants of sub-Laplacians
method Using Fourier decomposition and Selberg trace formulae
result Compact determinant formula expressed in terms of base hyperbolic surface and relative Selberg product
The abstract discusses detecting knotted spheres through their traces in high dimensions.
problem Detecting knotted spheres in high-dimensional spaces.
method Generalizing the RBG link construction to all dimensions and using surgery.
result Existence of non-isotopic smooth (n−2)-knots with diffeomorphic traces. Formula for twisted orbital integrals using hypoelliptic Laplacian.
problem Evaluate equivariant trace of Laplacians on compact locally symmetric spaces.
method Using the hypoelliptic Laplacian method and twisted trace formula.
result Explicit geometric formula for twisted orbital integrals.
Study categorifies link invariants using Soergel bimodules.
problem Categorification of link invariants.
method Explicit computation of derived traces of Soergel bimodules.
result Derived annular Khovanov-Rozansky link invariant.
The study computes trace fields and minimal polynomials for specific knots and links.
problem Computing trace fields and minimal polynomials for specific knots and links.
method Using factorization theorems for sparse polynomials.
result Results depend on the degrees of the trace fields over Q being sufficiently large.