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,291 papers · 148 categories

Trend · papers per month

1234 · Sep 201819922001200920182026
48 results for Bi-directional

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.

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.

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.

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.

JMVAE fails to generate large modalities, JMVAE-kl and JMVAE-h solve this issue.

problem Bi-directional generation between different modalities using VAEs fails for large modalities.
method Proposed JMVAE-kl and JMVAE-h to prevent collapse of joint representation and bi-directional generation.
result JMVAE-kl and JMVAE-h prevent collapse and generate modalities bi-directionally.

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 ↗

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.

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.

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.

Improved sentiment analysis explanations using LRP for RNNs.

problem Creating understandable explanations for recurrent neural network predictions.
method Extending Layer-wise Relevance Propagation (LRP) to recurrent neural networks (RNNs), specifically to multiplicative connections in LSTMs and GRUs.
result Better explanation quality for sentiment analysis tasks using LRP compared to gradient-based methods.

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 ↗

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.

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.

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.

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.

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.

Paper proposes RCD method to discover causal structure with latent confounders.

problem Causal discovery from data with latent confounders.
method Repetitive causal discovery (RCD) method to infer causal directions between observed variables.
result RCD effectively identifies latent confounders and causal directions between observed variables.

WeSinger improves singing voice synthesis with data augmentation and specialized modules.

problem Improving the accuracy and naturalness of synthesized singing voices.
method Developed a multi-singer Chinese neural singing voice synthesis system with deep bi-directional LSTM, Transformer, LPCNet, and data augmentation.
result WeSinger achieves state-of-the-art performance on the Opencpop corpus.

A new method for identifying Gaussian process state space models.

problem Challenges in learning the model of Gaussian process state space models.
method Structured Gaussian variational posterior distribution over latent states parameterized by a recognition model.
result The method allows for efficient computation of a lower bound on the marginal likelihood and generation of plausible future trajectories.