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

3978116155 · Jun 202019922001200920182026
48 results for bi-directional correspondence

New method identifies valid IVs for bi-directional MR with invalid instruments.

problem Estimating causal effects from observational data with invalid instruments and unmeasured confounding.
method Theoretical investigation and cluster fusion-like method to discover valid IV sets.
result Theoretical demonstration and experimental validation of the method's effectiveness.

Improved Q&A model with LSTM and bi-directional attention.

problem Enhancing neural network models for effective question answering.
method Implemented a Bi-directional attention flow layer connected to a Multi-layer LSTM encoder, with a new end-index decoder layer conditioning on start-index output.
result Increased model performance by 15.16% on test set.

BICompFL tackles bi-directional compression challenges in stochastic FL, reducing communication costs by an order of magnitude.

problem Communication bottleneck in federated learning, especially with stochastic updates.
method Introduces BICompFL, a bi-directional compression approach for stochastic federated learning.
result Significantly reduces communication costs (by an order of magnitude) while maintaining accuracy.

Novel technique detects adversarial samples in face recognition models.

problem Widespread adversarial sample attacks on DNN models.
method Bi-directional correspondence inference between attributes and internal neurons to identify critical neurons.
result 94% detection accuracy for 7 different kinds of attacks with 9.91% false positives.

The covariance graph (aka bi-directed graph) of a probability distribution pp is the undirected graph GG where two nodes are adjacent iff their corresponding random variables are marginally dependent in pp. In this paper, we present a graphical criterion for reading dependencies from GG, under the assumption that $…

2010-10-21abs ↗pdf ↗

DoCoFL compresses model updates for cross-device federated learning.

problem Downlink compression for cross-device federated learning where clients may appear only once.
method Proposes DoCoFL framework for downlink compression in cross-device federated learning.
result Significant bi-directional bandwidth reduction with competitive accuracy.

Bi-directional Curriculum Learning improves graph anomaly detection by considering both homogeneity and heterogeneity.

problem Existing graph anomaly detection methods often ignore the different contributions of nodes to training.
method Introduces Bi-directional Curriculum Learning (BCL) to optimize GAD methods by considering both homogeneity and heterogeneity of nodes.
result Extensive experiments show that BCL significantly improves the performance of GAD anomaly detection models.

PML-GAN tackles noisy multi-label annotations using adversarial learning.

problem Learning multi-label models from noisy, overcomplete annotations.
method PML-GAN uses a disambiguation network and a generative adversarial network to map noisy labels to clean labels and data samples.
result PML-GAN achieves state-of-the-art performance on partial multi-label learning datasets.

BiHRNN predicts inflation by leveraging hierarchical structure and bidirectional RNNs.

problem Accurate inflation forecasting is challenging due to dynamic factors and the layered structure of the Consumer Price Index.
method Bi-directional Hierarchical Recurrent Neural Network (BiHRNN) model that uses bidirectional information flow between levels and informative constraints on RNN parameters.
result BiHRNN significantly outperforms traditional RNN models in forecasting accuracy.

FedSGM tackles constrained federated learning with unified framework.

problem Functional constraints, communication bottlenecks, local updates, and partial client participation in federated learning.
method Unified framework based on switching gradient method, incorporating bi-directional error feedback, and soft switching for stability.
result Achieves O(1/T)\boldsymbol{\mathcal{O}}(1/\sqrt{T}) convergence rate with high-probability bounds decoupling from sampling noise.

Improved NER performance on imbalanced data.

problem Highly unbalanced training data in NER tasks.
method Adapted a neural architecture with CRF and BI-LSTM layers, using pre-trained embeddings. Introduced a two-class split to optimize performance.
result Significant improvement in performance for weak classes with minimal training data.

Bi-directional LSTMs are a powerful tool for text representation. On the other hand, they have been shown to suffer various limitations due to their sequential nature. We investigate an alternative LSTM structure for encoding text, which consists of a parallel state for each word. Recurrent steps are used to perform lo…

2018-05-07abs ↗pdf ↗

Confidentiality of patient information is an essential part of Electronic Health Record System. Patient information, if exposed, can cause a serious damage to the privacy of individuals receiving healthcare. Hence it is important to remove such details from physician notes. A system is proposed which consists of a deep…

2018-08-03abs ↗pdf ↗

Study neural networks learning from noisy examples via reverberation.

problem Learning from noisy examples in neural networks.
method Adapted Guerra's interpolation technique to provide statistical mechanics of supervised and unsupervised learning.
result Full phase diagrams and thresholds for learning are analytically obtained.

Recently, a technique called Layer-wise Relevance Propagation (LRP) was shown to deliver insightful explanations in the form of input space relevances for understanding feed-forward neural network classification decisions. In the present work, we extend the usage of LRP to recurrent neural networks. We propose a specif…

2017-06-22abs ↗pdf ↗

The work investigates deep generative models, which allow us to use training data from one domain to build a model for another domain. We propose the Variational Bi-domain Triplet Autoencoder (VBTA) that learns a joint distribution of objects from different domains. We extend the VBTAs objective function by the relativ…

2018-06-22abs ↗pdf ↗

AER combines auto-encoder and LSTM for better time series anomaly detection.

problem Anomaly detection in time series data with limited labeled data and ambiguous definitions.
method AER (Auto-Encoder with Regression) integrates auto-encoder and LSTM for joint predictions and reconstructions.
result AER achieves the highest F1 score across 12 datasets with comparable runtime.

A new method predicts protein functions using variable-length sequences.

problem Computational methods for protein function prediction are slow and inaccurate for long sequences.
method Two feature sets: single fixed-sized segments and multi-sized segments, using bi-directional LSTM. Combined with MLDA features.
result Significant improvement in accuracy for long protein sequences.

Non-autoregressive transformer improves speech recognition speed and accuracy.

problem Reducing inference computation cost in speech recognition.
method Two non-autoregressive transformer structures (A-CMLM and A-FMLM) trained with masked tokens and iterative prediction during inference.
result Non-autoregressive transformer can match autoregressive transformer performance with 7x speedup.

Bi-GAN model for imputing and predicting irregular time-series data.

problem Irregularly observed, varying length time-series data with missing entries.
method Bi-GAN model using a bidirectional recurrent network in a generative adversarial setting.
result Bi-GAN model can impute and predict missing values for time-series of varying length.

In this paper, we propose a probabilistic parsing model, which defines a proper conditional probability distribution over non-projective dependency trees for a given sentence, using neural representations as inputs. The neural network architecture is based on bi-directional LSTM-CNNs which benefits from both word- and …

2017-01-04abs ↗pdf ↗

State-of-the-art sequence labeling systems traditionally require large amounts of task-specific knowledge in the form of hand-crafted features and data pre-processing. In this paper, we introduce a novel neutral network architecture that benefits from both word- and character-level representations automatically, by usi…

2016-03-04abs ↗pdf ↗

We present our first efforts in building an automatic speech recognition system for Somali, an under-resourced language, using 1.57 hrs of annotated speech for acoustic model training. The system is part of an ongoing effort by the United Nations (UN) to implement keyword spotting systems supporting humanitarian relief…

2018-07-23abs ↗pdf ↗

Knots can be constructed and decomposed using Murasugi sums of Seifert surfaces.

problem Understanding the structure of knots through Murasugi sums.
method Using Murasugi sums to decompose and construct knots, showing the structure of a bi-directed complete graph.
result Any knot can be a Murasugi sum of any two knots, with bounds on minimal complexity.

New framework using Jensen-Shannon divergence improves domain adaptation theory.

problem Incoherence between empirical domain adversarial training and theoretical H\mathcal{H}-divergence.
method Established new theoretical framework based on Jensen-Shannon divergence, derived bi-directional upper bounds.
result Framework exhibits flexibilities for various transfer learning problems.

The Gaussian process state space model (GPSSM) is a non-linear dynamical system, where unknown transition and/or measurement mappings are described by GPs. Most research in GPSSMs has focussed on the state estimation problem, i.e., computing a posterior of the latent state given the model. However, the key challenge in…

2017-05-30abs ↗pdf ↗

CCHM algorithm learns BN structure with latent variables, improving causal effect measurement.

problem Latent variables cause spurious relationships in BN structure learning.
method Hybrid approach combining constraint-based and score-based learning, incorporating do-calculus.
result CCHM outperforms state-of-the-art in reconstructing true BN structure.

A comparison of SLDS and LSTM for pedestrian behavior prediction shows SLDS works better with shorter sequences.

problem Time-critical pedestrian behavior prediction in autonomous vehicles.
method Comparison of a switching linear dynamical system (SLDS) and a three-layered bi-directional LSTM neural network.
result SLDS achieves higher accuracy with shorter sequences (10 samples) compared to LSTM's 80% accuracy with 100 samples.

Adversarial Reprogramming has demonstrated success in utilizing pre-trained neural network classifiers for alternative classification tasks without modification to the original network. An adversary in such an attack scenario trains an additive contribution to the inputs to repurpose the neural network for the new clas…

2018-09-06abs ↗pdf ↗

BiSHop tackles tabular data challenges with sparse Hopfield layers.

problem Non-rotationally invariant data structure and feature sparsity in tabular data.
method Sequential column-wise and row-wise processing through interconnected directional learning modules with generalized sparse modern Hopfield layers.
result BiSHop surpasses current SOTA methods with significantly less hyperparameter tuning.

Navigated 2D multi-slice dynamic Magnetic Resonance (MR) imaging enables high contrast 4D MR imaging during free breathing and provides in-vivo observations for treatment planning and guidance. Navigator slices are vital for retrospective stacking of 2D data slices in this method. However, they also prolong the acquisi…

2018-04-12abs ↗pdf ↗

Several methods exist to infer causal networks from massive volumes of observational data. However, almost all existing methods require a considerable length of time series data to capture cause and effect relationships. In contrast, memory-less transition networks or Markov Chain data, which refers to one-step transit…

2016-08-08abs ↗pdf ↗

Framework generates pop song melodies and piano accompaniment.

problem Creating high-quality pop songs with automated systems.
method Unified strategy using three models: harmony alternation, melody generation, and melody integration.
result Generated melodies rated significantly higher than those from LSTM, and accompaniment comparable to Band in a Box.