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.

169,051 papers · 148 categories

Trend · papers per month

218437655873 · Jun 202019922001200920182026
48 results for neural tree decoding

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.

The task of translating between programming languages differs from the challenge of translating natural languages in that programming languages are designed with a far more rigid set of structural and grammatical rules. Previous work has used a tree-to-tree encoder/decoder model to take advantage of the inherent tree s…

2018-07-04abs ↗pdf ↗

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.

We discuss an autoencoder model in which the encoding and decoding functions are implemented by decision trees. We use the soft decision tree where internal nodes realize soft multivariate splits given by a gating function and the overall output is the average of all leaves weighted by the gating values on their path. …

2014-09-26abs ↗pdf ↗

Resource-efficient oblique trees reduce neural signal classification costs.

problem Implementing efficient neural signal classifiers on resource-constrained devices.
method Integrating model compression, probabilistic routing, and cost-aware learning.
result Significant reduction in model size and feature extraction cost compared to state-of-the-art models.

A new tree-Wasserstein distance for high-dimensional data with latent feature hierarchy.

problem Finding meaningful distances between high-dimensional data samples with latent feature hierarchy.
method Proposes a new tree-Wasserstein distance (TWD) for high-dimensional data with a latent feature hierarchy, using diffusion geometry and tree decoding.
result The proposed TWD effectively recovers the latent feature hierarchy and is efficient and scalable.

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…

2018-02-23abs ↗pdf ↗

Deep neural nets predict aircraft flight paths from weather data.

problem Accurate prediction of aircraft trajectories for aviation efficiency.
method Deep generative convolutional recurrent neural network with tree-based matching.
result Model accurately predicts aircraft flight paths from weather data.

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…

2017-08-02abs ↗pdf ↗

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…

2018-02-18abs ↗pdf ↗

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.

A new method for hierarchical clustering using continuous embeddings and optimization.

problem Hierarchical clustering with provable quality guarantees.
method Continuous relaxation of discrete optimization problem using hyperbolic embeddings and decoding.
result Continuous relaxation yields a discrete tree with (1 + epsilon)-factor approximation for optimal tree.

New measures link neural representation geometry to decoding ability.

problem Understanding how neural representations relate to decoding ability.
method Showed that popular similarity measures can be interpreted from a decoding perspective.
result Proved that measures like CKA and CCA quantify alignment between optimal linear readouts.

A major hurdle to clinical translation of brain-machine interfaces (BMIs) is that current decoders, which are trained from a small quantity of recent data, become ineffective when neural recording conditions subsequently change. We tested whether a decoder could be made more robust to future neural variability by train…

2016-10-19abs ↗pdf ↗

Deep generative models have been wildly successful at learning coherent latent representations for continuous data such as video and audio. However, generative modeling of discrete data such as arithmetic expressions and molecular structures still poses significant challenges. Crucially, state-of-the-art methods often …

2017-03-06abs ↗pdf ↗

New method improves neural decoding accuracy and reveals latent memory organization.

problem Improving neural decoding of temporal memory organization.
method Bayesian neural decoding using a diversity-encouraging latent representation learning method.
result Substantially higher accuracy in neural decoding and clear latent representation.

Improved neural keyphrase generation by beam search with reward functions.

problem Sequence length bias and beam diversity issues in neural keyphrase generation.
method Beam search decoding strategy with word-level and ngram-level reward functions.
result Significant improvement in generating diverse and accurate keyphrases.

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.

Memory-augmented neural networks improve machine translation performance.

problem Improving machine translation accuracy and flexibility.
method Evaluation of Neural Turing Machines and Differentiable Neural Computers for machine translation tasks.
result Memory-augmented neural networks perform similarly to attentional encoders on Vietnamese to English tasks but have lower BLEU scores on Romanian to English tasks.

A model learns stock trading rules from raw prices using encoder-decoder neural network.

problem Extracting features from long price sequences for profitable trading rules.
method Neural encoder-decoder framework combined with DRL.
result The model outperforms state-of-the-art models in dynamic environments.

Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing messages between variable and check nodes of the factor graph. The sum-product alg…

2014-05-25abs ↗pdf ↗

SIVAE integrates sentences and their syntactic trees for improved text generation.

problem Improving the grammar of generated text.
method SIVAE uses two separate latent spaces for sentences and syntactic trees, optimizing a joint distribution with two encoders and two decoders.
result SIVAE generates sentences with better grammar compared to existing models.

A simple encoder and complex decoder for secure image encryption and decryption.

problem Secure and efficient image encryption and decryption.
method Uses a shallow encoder neural network for encryption and a deep decoder for decryption, trained independently.
result Decrypted images are nearly identical to the original, demonstrating the effectiveness of the framework.

NP2^2MT uses phrase attention to translate phrases efficiently.

problem Phrase-based machine translation inefficiency and performance degradation across different distributions.
method Phrase attention mechanism and dynamic programming for efficient decoding.
result NP2^2MT achieves comparable performance and outperforms state-of-the-art methods in certain conditions.

This work proposes a method to control gradient descent in neural networks using a decoder with shared weights.

problem Efficient few-shot learning and model adaptation in meta-learning.
method A decoder network is used to control the gradient descent process of model parameters in a low-dimensional latent space, sharing weights to reduce parameter requirements.
result The proposed approach outperforms existing methods in tasks like Omniglot and miniImageNet classification.

C3 compresses images and videos with low complexity and high performance.

problem High complexity and low performance in neural compression models.
method Overfits a small model to each image or video separately, improving RD performance with low complexity.
result Matches the RD performance of state-of-the-art neural and video codecs with significantly lower decoding complexity.

Proposes Decodable Information Bottleneck for optimal representation learning.

problem Finding optimal representations for supervised learning.
method Integrates information retention and compression with the desired predictive family.
result Optimal representations lead to better expected test performance and can be estimated with guarantees.