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.

168,695 papers · 148 categories

Trend · papers per month

2457 · Feb 202019922001200920172026
48 results for RNA HTS

ChemCPA predicts cellular responses to novel drugs using transfer learning.

problem Scaling high-throughput screens to measure cellular responses for many drugs is costly and challenging.
method ChemCPA, a new encoder-decoder architecture combined with transfer learning.
result Training on existing bulk RNA HTS datasets improves generalization performance, reducing the need for extensive single-cell screens.

New insights into why neural networks generalize well.

problem Understanding why neural networks generalize well despite heavy-tailed weight distributions.
method Developed a simple model to analyze the emergence of heavy-tailed empirical spectral densities (ESDs) in two-layer neural networks without gradient noise.
result Learning rates play a crucial role in shaping the ESDs of two-layer neural networks, leading to better generalization.

Machine learning improves RNA secondary structure prediction.

problem Stagnant performance of RNA secondary structure prediction methods.
method Machine learning, especially deep learning, is used to predict RNA secondary structures.
result Machine learning methods have improved the prediction of RNA secondary structures.

Designing RNA molecules has garnered recent interest in medicine, synthetic biology, biotechnology and bioinformatics since many functional RNA molecules were shown to be involved in regulatory processes for transcription, epigenetics and translation. Since an RNA's function depends on its structural properties, the RN…

2018-12-31abs ↗pdf ↗

Generalized quandle polynomial used for stuquandles, stuck links, and RNA folding.

problem Defining polynomial invariants for stuquandles, stuck links, and RNA foldings.
method Introduced a generalized quandle polynomial and proved its invariance for stuquandles. Used this invariant to define polynomials for stuck links and RNA foldings.
result Polynomial invariants for stuquandles, stuck links, and RNA foldings.

A deep learning model organizes RNA graphs to reveal folding patterns and properties.

problem Organizing and understanding the complex folding patterns of RNA secondary structures.
method Geometric scattering autoencoder (GSAE) network for learning graph embeddings.
result GSAE accurately reflects bistable RNA structures and can sample new folding trajectories.

New benchmarks for RNA 3D structure-function modeling.

problem Lack of standardized benchmarks for RNA deep learning.
method Developed seven benchmark datasets, provided tools for data handling, and offered a user-friendly environment for model comparison.
result Demonstrated utility with baseline results using a relational graph neural network.

Let RR be a compact, connected, orientable surface of genus gg with nn boundary components with g2g \geq 2, n0n \geq 0. Let N(R)\mathcal{N}(R) be the nonseparating curve graph, C(R)\mathcal{C}(R) be the curve graph and HT(R)\mathcal{HT}(R) be the Hatcher-Thurston graph of RR. We prove that if $λ: \mathcal{N}(R) \rightarro…

2017-08-15abs ↗pdf ↗

The Regularized Nonlinear Acceleration (RNA) algorithm is an acceleration method capable of improving the rate of convergence of many optimization schemes such as gradient descend, SAGA or SVRG. Until now, its analysis is limited to convex problems, but empirical observations shows that RNA may be extended to wider set…

2018-06-01abs ↗pdf ↗

New method detects RNA modifications without prior training, revealing novel sites.

problem Detecting RNA modifications with high accuracy and sensitivity.
method Anomaly detection using nanopore raw ionic current signals and nearest neighbor comparison.
result Detects diverse RNA modifications without prior training, including a novel 2'-O-methylated site in DENV.

Let XX be a compact, geodesically complete, locally CAT(0) space such that the universal cover admits a rank one axis. Assume XX is not homothetic to a metric graph with integer edge lengths. Let PtP_t be the number of parallel classes of oriented closed geodesics of length t\le t; then $\lim\limits_{t \to \infty} P…

2019-03-18abs ↗pdf ↗

Study uses knot theory to model RNA foldings, emphasizing both entanglement and intrachain interactions.

problem Modeling RNA foldings considering both entanglement and intrachain interactions.
method Combines knot theory with embedded rigid vertex graphs to emphasize both entanglement and intrachain interactions of RNA foldings.
result Defines and computes a coloring counting invariant for stuck links, providing explicit computations for arc diagrams of RNA foldings.

Improved GPLVM model for single-cell RNA-seq data.

problem Lack of effective scalable models for clustering cell types in large-scale single-cell RNA-seq data.
method Introduces amortized stochastic variational Bayesian GPLVM (BGPLVM) tailored for single-cell RNA-seq.
result Matches the performance of scVI on synthetic and real-world datasets and reveals more interpretable latent structures.

HSSE framework embeds single-cell RNA-seq data at multiple scales.

problem Capturing heterogeneous local structure in single-cell RNA-seq data.
method Hierarchical sheaf spectral embedding (HSSE) framework.
result HSSE achieves competitive or improved performance in single-cell RNA-seq data representation learning.

Let S1S_{1} and S2S_{2} be connected orientable surfaces of genus g1,g23g_{1}, g_{2} \geq 3, n1,n20n_{1},n_{2} \geq 0 punctures, and empty boundary. Let also φ:HT(S1)HT(S2)\varphi: \mathcal{HT}(S_{1}) \rightarrow \mathcal{HT}(S_{2}) be an edge-preserving alternating map between their Hatcher-Thurston graphs. We prove that $g_{1} \leq g_{2…

2016-11-30abs ↗pdf ↗

A novel text-independent speaker identification (SI) method is proposed. This method uses the Mel-frequency Cepstral coefficients (MFCCs) and the dynamic information among adjacent frames as feature sets to capture speaker's characteristics. In order to utilize dynamic information, we design super-MFCCs features by cas…

2018-08-02abs ↗pdf ↗

Non-coding RNA (ncRNA) are RNA sequences which don't code for a gene but instead carry important biological functions. The task of ncRNA classification consists in classifying a given ncRNA sequence into its family. While it has been shown that the graph structure of an ncRNA sequence folding is of great importance for…

2019-05-16abs ↗pdf ↗

Recent advances in high-throughput cDNA sequencing (RNA-Seq) technology have revolutionized transcriptome studies. A major motivation for RNA-Seq is to map the structure of expressed transcripts at nucleotide resolution. With accurate computational tools for transcript reconstruction, this technology may also become us…

2013-09-20abs ↗pdf ↗

In this paper, we propose an end-to-end deep learning model, called E2Efold, for RNA secondary structure prediction which can effectively take into account the inherent constraints in the problem. The key idea of E2Efold is to directly predict the RNA base-pairing matrix, and use an unrolled algorithm for constrained p…

2020-02-13abs ↗pdf ↗

RNA structures show that a significant portion of bases do not form hydrogen bonds.

problem Understanding the unpaired bases in RNA secondary structures.
method Comparing random words in free groups to RNA sequences, analyzing word lengths.
result The expected fraction of unpaired bases converges to a constant λ2λ_2.

The paper benchmarks data stream classifiers for human activity recognition on connected devices.

problem Challenges in human activity recognition on connected devices, particularly high memory consumption and low F1 scores.
method Evaluation of five stream classification algorithms on real and synthetic datasets, measuring both performance and resource consumption.
result HT and MF classifiers show superior performance and resilience to concept drift compared to other algorithms.

We study the secondary structure of RNA determined by Watson-Crick pairing without pseudo-knots using Milnor invariants of links. We focus on the first non-trivial invariant, which we call the Heisenberg invariant. The Heisenberg invariant, which is an integer, can be interpreted in terms of the Heisenberg group as wel…

2008-09-18abs ↗pdf ↗

Symmetric CNNs improve sequential recommendation and protein structure prediction.

problem Improving prediction accuracy in sequential recommendation and protein structure inference.
method Developed a CNN architecture that preserves symmetry in convolutional layers, using parameterized convolutional kernels.
result Symmetric structured CNNs achieve better performance with fewer parameters.

Regularized nonlinear acceleration (RNA) estimates the minimum of a function by post-processing iterates from an algorithm such as the gradient method. It can be seen as a regularized version of Anderson acceleration, a classical acceleration scheme from numerical analysis. The new scheme provably improves the rate of …

2018-05-24abs ↗pdf ↗

Treebolic space is an analog of the Sol geometry, namely, it is the horocylic product of the hyperbolic upper half plane H and the homogeneous tree T with degree p+1 > 2, the latter seen as a one-complex. Let h be the Busemann function of T with respect to a fixed boundary point. Then for real q > 1 and integer p > 1, …

2012-12-26abs ↗pdf ↗

In this work we propose a method to compute continuous embeddings for kmers from raw RNA-seq data, without the need for alignment to a reference genome. The approach uses an RNN to transform kmers of the RNA-seq reads into a 2 dimensional representation that is used to predict abundance of each kmer. We report that our…

2018-10-08abs ↗pdf ↗

Study analyzes neural network models to understand generalization performance.

problem Understanding good generalization in neural networks.
method Analyzed a corpus of models from a public contest, breaking ALPHAHAT into scale and shape metrics.
result Identified a Simpson's paradox in metric performance across different model depths and regularization hyperparameters.

A new model synthesizes population with fewer structural and sampling zeros.

problem Synthesizing a feasible and diverse synthetic population from limited data.
method A deep generative model with two regularizations to minimize structural zeros and preserve sampling zeros.
result The model significantly improves feasibility and diversity of synthetic populations.