Research
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

124248371495 · Jun 202019922001200920172026
48 results for Symbol Error Rate

This paper presents a ML-based receiver for SDR that outperforms conventional methods.

problem Complexity and performance issues in multiuser detection.
method Supervised learning for direct symbol detection without parameter estimation.
result The ML-based receiver achieves similar or better performance than SIC and MMSE receivers.

GT estimator shows convergence for Markov samples, improving i.i.d. results.

problem Estimating missing mass in Markov samples.
method Analyzed convergence of Good-Turing estimator for Markov samples, considering spectral properties of transition matrices.
result The convergence of the GT estimator for Markov samples depends on the spectral properties of the transition matrices, leading to a new minimax rate of 1/(nβ5)1/(nβ^5) for rank-2 Markov chains.

Paper closes neural-symbolic learning loop with grammar model and back-search algorithm.

problem Slow convergence in neural-symbolic learning due to error propagation issues.
method Introduces grammar model as symbolic prior and back-search algorithm for efficient error propagation.
result Significantly outperforms RL methods in performance, converging speed, and data efficiency.

Study approximates operator learning for PDEs using Fourier multipliers.

problem Approximating operator behavior for PDE simulations.
method Approximation of operator symbols in Fourier domain using semi-norms.
result Identifies conditions for achieving predefined approximation error.

Graph-based approach repairs programs from diagnostic feedback.

problem Learning to repair programs from limited labeled data and compiler error messages.
method Introduces program-feedback graph and graph neural network for reasoning, and self-supervised learning with unlabeled programs.
result DrRepair significantly outperforms prior work, achieving high repair rates.

This paper proves properties of uniformly hyperbolic sets and constructs Markov partitions.

problem Establishing properties of uniformly hyperbolic sets and constructing Markov partitions.
method Backward graph transform, spectral decomposition, shadowing lemma, Markov partitions construction.
result Explicit bounds and Hölder continuity for the coding map.

Quantum 6j6j-symbols linked to tetrahedra angles and volumes.

problem Understanding quantum 6j6j-symbols and their geometric interpretation.
method Establishing the geometric connection between quantum 6j6j-symbols and tetrahedra angles, including spherical, Euclidean, and hyperbolic cases.
result Quantum 6j6j-symbols correspond to dihedral angles of specific tetrahedra, including generalized hyperbolic ones, with exponential growth rates tied to their volumes.

Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable transmission of coded symbols. Traditional encoding and decoding of constrained …

2018-09-06abs ↗pdf ↗

Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.

problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.

In this paper, we implement an optical fiber communication system as an end-to-end deep neural network, including the complete chain of transmitter, channel model, and receiver. This approach enables the optimization of the transceiver in a single end-to-end process. We illustrate the benefits of this method by applyin…

2018-04-11abs ↗pdf ↗

New insights into image compression trade-offs with private randomness.

problem Trade-off between compression rate and perceptual quality in image compression.
method Characterization of rate-distortion trade-off with private randomness under different realism constraints.
result Encoder private randomness is not useful if compression rate is below source entropy, even with limited common and decoder private randomness.

Develops a Bayesian framework for symbolic regression of scientific expressions.

problem Lack of principled uncertainty quantification and interpretability in existing symbolic regression methods.
method Hierarchical Bayesian framework with tree-structured symbolic expressions and Markov chain Monte Carlo inference.
result Robust performance on various datasets, including single-atom catalysis.

This work adapts RDT for mental program construction, showing benefits and costs.

problem Applying RDT to mental programs with trade-offs between description length, error, and computational costs.
method Proposed a three-way trade-off and used simulations and partial information decomposition.
result Constructing a shared program library provides global benefits but is sensitive to curricula.

New MIMO constellation design for noncoherent communications reduces hardware complexity.

problem Designing efficient MIMO constellations for noncoherent communications over fading channels.
method Geodesic curves of the Grassmann manifold for structured constellation design.
result Achieves comparable error performance to unstructured designs with reduced hardware complexity.

We compute the asymptotical growth rate of a large family of Uq(sl2)U_q(sl_2) 6j6j-symbols and we interpret our results in geometric terms by relating them to volumes of hyperbolic truncated tetrahedra. We address a question which is strictly related with S.Gukov's generalized volume conjecture and deals with the case of hy…

2006-11-13abs ↗pdf ↗

We prove the Turaev-Viro invariants volume conjecture for a "universal" class of cusped hyperbolic 3-manifolds that produces all 3-manifolds with empty or toroidal boundary by Dehn filling. This leads to two-sided bounds on the volume of any hyperbolic 3-manifold with empty or toroidal boundary in terms of the growth r…

2018-07-09abs ↗pdf ↗

EPSTE: A geometric token and deep learning approach to estimating transfer entropy in neuroimaging time series

problem Inferring directed interactions between neural systems from EEG and MEG
method Reframing TE estimation as a learnable problem operating on structured symbolic representations
result EPSTE achieves near-perfect recovery of ground-truth directed structure and significantly lower absolute error than the baseline

PAN+SR tackles scalable symbolic regression for large pp datasets.

problem Symbolic regression struggles with large number of input variables and measurement error.
method Combines ab initio nonparametric variable selection with SR to pre-screen and reduce search complexity.
result PAN+SR consistently enhances 19 SR methods' performance on challenging datasets.

Deep neural networks approximate option prices in high-dimensional Lévy models efficiently.

problem Approximating option prices in high-dimensional financial models with jumps.
method Use of deep ReLU neural networks to approximate option prices in multivariate Lévy processes with polynomial growth in network size and dimension.
result Established sufficient conditions for polynomial growth in network size and dimension to approximate option prices with error ε.

Discover equations of motion from distorted video frames.

problem Learning equations of motion from unlabeled, distorted video.
method Train an autoencoder to map frames into latent space, then use symbolic regression to find differential equations.
result The method can discover motion equations even when video is distorted.

Reinforcement learning algorithms can solve dynamic decision-making and optimal control problems. With continuous-valued state and input variables, reinforcement learning algorithms must rely on function approximators to represent the value function and policy mappings. Commonly used numerical approximators, such as ne…

2019-03-22abs ↗pdf ↗

This work improves the Euler method for masked diffusion models, providing tighter convergence guarantees.

problem Improving the convergence rates of masked diffusion models.
method Developed a direct total-variation (TV) based analysis for the Euler method, relaxing assumptions and improving parameter dependencies.
result Established convergence guarantees for the Euler sampler without requiring surrogate initialization, and provided a tight lower bound.

GADD accelerates uniform-rate discrete diffusion models by 2 orders of magnitude.

problem Slow sampling in uniform-rate discrete diffusion models.
method Gibbs-based corrector (GADD) that constructs Gibbs posterior likelihoods directly from the concrete score function.
result Achieves an overall sampling complexity of O(polylog(ε1))\mathcal{O}(\mathrm{polylog} (\varepsilon^{-1})).

In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and …

2018-04-02abs ↗pdf ↗

Symbol detection for Massive Multiple-Input Multiple-Output (MIMO) is a challenging problem for which traditional algorithms are either impractical or suffer from performance limitations. Several recently proposed learning-based approaches achieve promising results on simple channel models (e.g., i.i.d. Gaussian). Howe…

2019-06-11abs ↗pdf ↗

Bayesian sequence prediction is a simple technique for predicting future symbols sampled from an unknown measure on infinite sequences over a countable alphabet. While strong bounds on the expected cumulative error are known, there are only limited results on the distribution of this error. We prove tight high-probabil…

2013-06-29abs ↗pdf ↗

We describe dimensionally constrained symbolic regression which has been developed for mass measurement in certain classes of events in high-energy physics (HEP). With symbolic regression, we can derive equations that are well known in HEP. However, in problems with large number of variables, we find that by constraini…

2011-06-20abs ↗pdf ↗

For an arbitrary Riemannian manifold XX and Hermitian vector bundles EE and FF over XX we define the notion of the normal symbol of a pseudodifferential operator PP from EE to FF. The normal symbol of PP is a certain smooth function from the cotangent bundle TXT^*X to the homomorphism bundle Hom(E,F)Hom (E,F) and dep…

1996-12-11abs ↗pdf ↗

Based on the ideas of Optimal Control, we introduce the new basic characteristic of a bracket generating distribution, the Jacobi symbol. In contrast to the classical Tanaka symbol, the set of Jacobi symbols is discrete and classifiable. We give an explicit and unified algebraic procedure for the construction of the ca…

2016-10-29abs ↗pdf ↗

Discovering quasipotential equations from data using machine learning.

problem Understanding escape mechanisms from metastable states in nonlinear systems.
method Combining neural networks and sparse regression to symbolically reconstruct quasipotential equations.
result Model-unbiased analytical forms of quasipotential discovered directly from data.