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.
Quantum-enhanced barcode decoding and pattern recognition outperforms classical methods.
New metrics and coordinates for barcode space using group theory.
We propose to study neural networks' loss surfaces by methods of topological data analysis. We suggest to apply barcodes of Morse complexes to explore topology of loss surfaces. An algorithm for calculations of the loss function's barcodes of local minima is described. We have conducted experiments for calculating barc…
We define notions of differentiability for maps from and to the space of persistence barcodes. Inspired by the theory of diffeological spaces, the proposed framework uses lifts to the space of ordered barcodes, from which derivatives can be computed. The two derived notions of differentiability (respectively from and t…
Entropy measures geodesic flow complexity.
MuRiT efficiently computes multi-parameter persistence barcodes.
We introduce a new feature map for barcodes that arise in persistent homology computation. The main idea is to first realize each barcode as a path in a convenient vector space, and to then compute its path signature which takes values in the tensor algebra of that vector space. The composition of these two operations …
This article introduces an application of Ghrist barcodes in the study of persistent Betti numbers derived from vortex nerve complexes found in triangulations of video frames. A Ghrist barcode is a topology of data pictograph useful in representing the persistence of the features of changing shapes. The basic approach …
Paper introduces stable vectorization for multiparameter PH using signed barcodes.
Introduces TSI, a variance-based measure for persistence barcodes.
Homotopy types of Vietoris-Rips metric thickenings of the circle confirmed.
Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.
We consider different notions of equivalence for Morse functions on the sphere in the context of persistent homology, and introduce new invariants to study these equivalence classes. These new invariants are as simple, but more discerning than existing topological invariants, such as persistence barcodes and Reeb graph…
Paper stabilizes persistent homology rank functions for statistical inference.
Symplectic homology matches dual capacities for convex domains.
Floer theory constructs filtrations on quantum cohomology for symplectic manifolds.
We apply the barcodes of persistent homology theory to the Chekanov-Eliashberg algebra of a Legendrian submanifold to deduce displacement energy bounds for arbitrary Legendrians. We do not require the full Chekanov-Eliashberg algebra to admit an augmentation as we linearize the algebra only below a certain action level…
Detection of rare variants by resequencing is important for the identification of individuals carrying disease variants. Rapid sequencing by new technologies enables low-cost resequencing of target regions, although it is still prohibitive to test more than a few individuals. In order to improve cost trade-offs, it has…
As a technology to read brain states from measurable brain activities, brain decoding are widely applied in industries and medical sciences. In spite of high demands in these applications for a universal decoder that can be applied to all individuals simultaneously, large variation in brain activities across individual…
Novel low-rank neural decoder improves -ECoG neural decoding.
The paper introduces FMCI and hybrid decoding for hidden Markov models.
Study examines how decoding algorithms affect fairness in language generation models.
Deep learning aids ADMM-based decoding for binary linear codes.
We present RL-VAE, a graph-to-graph variational autoencoder that uses reinforcement learning to decode molecular graphs from latent embeddings. Methods have been described previously for graph-to-graph autoencoding, but these approaches require sophisticated decoders that increase the complexity of training and evaluat…
In this paper, we use reinforcement learning to find effective decoding strategies for binary linear codes. We start by reviewing several iterative decoding algorithms that involve a decision-making process at each step, including bit-flipping (BF) decoding, residual belief propagation, and anchor decoding. We then ill…
This paper analyzes speculative decoding, a method to speed up large language model inferences.
Finding optimal correction of errors in generic stabilizer codes is a computationally hard problem, even for simple noise models. While this task can be simplified for codes with some structure, such as topological stabilizer codes, developing good and efficient decoders still remains a challenge. In our work, we syste…
Improving the interpretability of brain decoding approaches is of primary interest in many neuroimaging studies. Despite extensive studies of this type, at present, there is no formal definition for interpretability of brain decoding models. As a consequence, there is no quantitative measure for evaluating the interpre…
Recent developments in the field of deep learning have motivated many researchers to apply these methods to problems in quantum information. Torlai and Melko first proposed a decoder for surface codes based on neural networks. Since then, many other researchers have applied neural networks to study a variety of problem…
CARDS improves decoding efficiency and alignment quality for LLMs.
The paper develops a theory for speculative decoding acceptance criteria.
Inspired by recent advances in deep learning, we propose a novel iterative BP-CNN architecture for channel decoding under correlated noise. This architecture concatenates a trained convolutional neural network (CNN) with a standard belief-propagation (BP) decoder. The standard BP decoder is used to estimate the coded b…
This work proposes an efficient autoregressive model for text generation.
Proposes a secure communication method independent of eavesdropper's decoder.
Finding efficient decoders for quantum error correcting codes adapted to realistic experimental noise in fault-tolerant devices represents a significant challenge. In this paper we introduce several decoding algorithms complemented by deep neural decoders and apply them to analyze several fault-tolerant error correctio…
DD-VAE uses deterministic decoding for better latent code utilization in discrete data.
New method aligns brain data across individuals for better brain decoding.
A new method for effective VAE training using calibrated decoders.
Decoding, ie prediction from brain images or signals, calls for empirical evaluation of its predictive power. Such evaluation is achieved via cross-validation, a method also used to tune decoders' hyper-parameters. This paper is a review on cross-validation procedures for decoding in neuroimaging. It includes a didacti…
Deep learning techniques have revolutionized the field of machine learning and were recently successfully applied to various classification problems in noninvasive electroencephalography (EEG). However, these methods were so far only rarely evaluated for use in intracranial EEG. We employed convolutional neural network…
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 …
New insights into how encoder-decoder networks generate attention matrices.
Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords are sparse linear combinations of columns of the matrix. In this paper, we prop…
Despite rapid advances in machine learning tools, the majority of neural decoding approaches still use traditional methods. Modern machine learning tools, which are versatile and easy to use, have the potential to significantly improve decoding performance. This tutorial describes how to effectively apply these algorit…
New insights into encoder-decoder structures using information measures.
In this manuscript, we investigate deep invertible networks for EEG-based brain signal decoding and find them to generate realistic EEG signals as well as classify novel signals above chance. Further ideas for their regularization towards better decoding accuracies are discussed.
Entropy-based decoding improves DLM sampling efficiency.
New method uses Fisher-Rao metric for non-Gaussian decoders.