New algorithms decode Markov chains with near-optimal performance, even with small latency.
problem Online decoding of nth order ergodic Markov chains with latency constraints. method Deterministic and randomized algorithms using dynamic programs, with lower bounds established.
result Near-optimal performance of algorithms with minimal latency, outperforming existing methods.
Improved online AED models with multi-stage training and multi-task learning.
problem Enhance performance of online attention-based encoder-decoder models.
method Three-stage training with character encoder, BPE encoder, and attention decoder; multi-task learning at character and BPE levels; transfer learning from bidirectional encoder.
result 35% and 10% relative improvement over baselines for smaller and bigger models, respectively.
Locally private online quantile regression method addresses privacy constraints.
problem Estimating and inferring quantile regression under local differential privacy constraints.
method Developed a finite-alphabet channel where users compute local contributions, apply randomized response, and send reports. A public decoder corrects distortion and reconstructs inputs for averaging.
result Established local privacy, decoder unbiasedness, consistency, asymptotic normality, and inference for scalar contrasts.
Adaptive speculative decoding framework for LLMs using bandit algorithms.
problem Adaptive speculative decoding for LLMs to balance speed and quality.
method Formulated as a Multi-Armed Bandit problem, proposed UCBSpec and EXP3Spec algorithms.
result UCBSpec algorithm achieves optimal regret performance up to universal constants.
Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptiv…
Objective: Using traditional approaches, a Brain-Computer Interface (BCI) requires the collection of calibration data for new subjects prior to online use. Calibration time can be reduced or eliminated e.g.~by transfer of a pre-trained classifier or unsupervised adaptive classification methods which learn from scratch …
DyEnsemble improves BCI accuracy by adapting to nonstationary neural signals.
problem Nonstationary neural signals in BCI cause decoding errors.
method Dynamic ensemble modeling that learns and combines diverse models online.
result DyEnsemble outperforms Kalman filters, especially with noisy signals.
Paper proposes an online speech recognition model using Transformer.
problem Challenges in deploying Transformer-based E2E ASR for online speech recognition.
method Chunk self-attention encoder (chunk-SAE) and monotonic truncated attention (MTA) based self-attention decoder (SAD).
result Achieved 23.66% CER with 320 ms latency, significant improvement over offline models.
Convolutional Neural Networks (CNN) outperform traditional classification methods in many domains. Recently these methods have gained attention in neuroscience and particularly in brain-computer interface (BCI) community. Here, we introduce a CNN optimized for classification of brain states from magnetoencephalographic…
Algorithm improves continuous control with context, achieving provable efficiency.
problem Building an agent that generalizes to unseen environments in continuous control.
method Uses upper confidence bound (UCB) to refine decoder estimates and balance exploration-exploitation.
result Proves $\widetilde{O}\left(\sqrt{T}
ight)$ regret bound and ε-suboptimal policy transfer. The paper proposes a new method for online image decomposition using auto-encoders.
problem Building a part-based representation of image datasets for interpretation and online computation.
method Sparse, non-negative auto-encoder with deep encoder and shallow decoder for online computation.
result The method outperforms state-of-the-art online methods on MNIST and Fashion MNIST datasets.
Adaptive Quantization Modules enable online continual compression of non-i.i.d data streams.
problem Learning to compress and store a dataset from a non-i.i.d data stream, only observing each sample once.
method Discrete auto-encoders and Adaptive Quantization Modules (AQM) to control compression ability.
result Significant gains on continual learning benchmarks with AQM replacing episodic memory.
System supports 102 languages with deep neural networks, reducing error rates and improving recognition speed.
problem Online handwriting recognition for multiple languages with high accuracy and speed.
method Deep neural network architecture, Bézier curves for input encoding, sequence recognition methods.
result Reduced error rates by 20%-40% for most languages, up to 10x faster recognition times.
CMDNet simplifies MAP detection for large systems with probabilistic relaxation.
problem High complexity of MAP detection in large systems.
method Probabilistic Continuous relaxation of discrete variables, iterative CMD algorithm, CMDNet with online optimization.
result CMDNet achieves a promising accuracy-complexity trade-off in MIMO systems.
Many modern applications deal with multi-label data, such as functional categorizations of genes, image labeling and text categorization. Classification of such data with a large number of labels and latent dependencies among them is a challenging task, and it becomes even more challenging when the data is received onl…
We are motivated by problems that arise in a number of applications such as Online Marketing and Explosives detection, where the observations are usually modeled using Poisson statistics. We model each observation as a Poisson random variable whose mean is a sparse linear superposition of known patterns. Unlike many co…
DynGraph2Seq predicts health stages from user activity graphs in online forums.
problem Predicting health stages from changing user activities in online forums.
method Formulated user activities as dynamic graphs, used DynGraph2Seq model with hierarchical attention.
result Demonstrated effectiveness and interpretability of DynGraph2Seq.
New attacks reveal dataset changes in online learning models.
problem Data leakage in online learning models after updates.
method Encoder-decoder formulation, hybrid generative model (CBM-GAN).
result Proposed attacks achieve strong performance in inferring updating set information.
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.
problem Challenging neural decoding from high-dimensional μ-ECoG data. method Low-rank structure in neural network decoder.
result Low-rank decoder outperforms standard PCA.
The paper introduces FMCI and hybrid decoding for hidden Markov models.
problem Computing distributions and decoding hidden state sequences in HMMs.
method Finite Markov chain imbedding (FMCI) and hybrid decoding.
result Hybrid decoding improves performance over traditional methods.
Study examines how decoding algorithms affect fairness in language generation models.
problem Impact of decoding algorithms on fairness in open-ended language generation.
method Systematic analysis of top-p, top-k, and temperature decoding algorithms. result Decoding algorithms significantly impact fairness across demographic groups.
Paper uses RL to optimize bit-flipping decoding for binary codes.
problem Improving bit-flipping decoding for binary linear codes.
method Mapped iterative decoding algorithms to MDPs for reinforcement learning.
result Learned BF decoders offer performance-complexity trade-offs and near-optimal performance.
Deep invertible networks decode EEG signals better than chance.
problem Decoding brain signals from EEG data.
method Deep invertible networks for generating and classifying brain signals.
result Deep invertible networks generate realistic EEG signals and classify novel signals above chance.
RL-VAE uses RL to decode molecular graphs from latent embeddings.
problem Efficiently decoding molecular graphs from latent embeddings.
method Repurposed simple graph generator for efficient decoding.
result Decoding molecular graphs from latent embeddings is possible with a simple graph generator.
Deep learning aids ADMM-based decoding for binary linear codes.
problem Improving decoding efficiency for binary linear codes.
method Designing a decoding network based on ADMM and deep learning.
result Numerical results show improved performance compared to original ADMM.
This paper analyzes speculative decoding, a method to speed up large language model inferences.
problem Theoretical understanding of speculative decoding is lacking.
method Conceptualizes speculative decoding as a markov chain problem and studies its key properties.
result Reveals fundamental connections between LLM components and their impact on decoding efficiency.
Neural decoder improves topological code performance.
problem Improving error correction for topological codes.
method Two-step neural network using pseudo-inverse of parity check matrix.
result Outperforms state-of-the-art non-neural decoders for 2D hexagonal color codes.
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…
CARDS improves decoding efficiency and alignment quality for LLMs.
problem Efficiency bottlenecks in decoding-time alignment for LLMs.
method Cascade Reward Sampling (CARDS) with segment-level rejection sampling and uncertainty-based segmentation.
result Significant improvement in decoding efficiency and alignment quality.
The paper develops a theory for speculative decoding acceptance criteria.
problem Speculative decoding's acceptance criteria and their rejection regions.
method Characterization of rejection regions as lower level sets of the target distribution, derivation of exact and margin-based certificates.
result Relaxed and tree-based acceptance criteria substantially enlarge the region of certified acceptance.
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.
problem The challenge of generating high-quality text with autoregressive models.
method Introduces a cascaded decoding approach using Markov transformers to achieve sub-linear parallel time generation.
result Shows competitive accuracy/speed tradeoff compared to existing methods on five machine translation datasets.
Proposes a secure communication method independent of eavesdropper's decoder.
problem Lack of practical security constraints in existing methods.
method Dual MINE-based neural secure communications model.
result Security performance is not affected by eavesdropper's decoding means.
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…
This work prevents variational autoencoders from collapsing by adding an auxiliary decoder.
problem Variational autoencoders can collapse into autodecoders, losing semantic information.
method Adding an auxiliary decoder to regularize the latent space.
result Auxiliary decoders increase semantic information in the latent space and reconstructions.
DD-VAE uses deterministic decoding for better latent code utilization in discrete data.
problem Inflexible decoders in VAEs lead to poor utilization of latent codes in discrete data.
method Proposed DD-VAE with deterministic decoding and new proposal distributions.
result DD-VAE improves latent code utilization and structure of learned manifold.
New method aligns brain data across individuals for better brain decoding.
problem Inter-individual variability in brain response patterns limits decoder generalization.
method SpectralOT method that embeds cortical geometry into Laplace-Beltrami eigenmodes.
result SpectralOT strikes balance between aligning functional features and preserving anatomical structure.
Deep learning classifies mobile traffic from LTE PDCCH.
problem Automatic classification of mobile applications and services.
method Convolutional Neural Network (CNN) trained on DCI messages.
result 99% accuracy in classifying traffic from LTE PDCCH.
A new method for effective VAE training using calibrated decoders.
problem Training VAEs requires hyperparameter tuning, leading to inefficiency.
method Calibrated decoders that learn uncertainty and automatically determine information retention.
result Calibrated decoders can simplify VAE training without heuristic modifications.
Dual-decoder model generates responses with targeted sentiment.
problem Generating human-like responses with specific sentiment.
method Simple dual-decoder model with two sentiment decoders connected to one encoder.
result Significant performance gain in sentiment accuracy and word diversity.
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…
Scores political leanings in Web3 betting markets.
problem Understanding political motivations in decentralized prediction markets.
method Constructing PBLS from Polymarket data, analyzing 15k addresses, 4k events, 8k markets.
result Validated PBLS through internal and external comparisons, revealing political and profit motives.
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.
problem Understanding how encoder-decoder networks use attention matrices.
method Decomposing hidden states into temporal and input-driven components.
result Attention matrices are formed based on task requirements, not architecture type.
Deep neural networks decode natural visual scenes from neural spikes.
problem Decoding visual scenes from neural spikes for brain-machine interfaces.
method Developed a novel spike-image decoder (SID) using deep neural networks.
result SID reconstructs natural visual scenes from neural spikes with high accuracy.