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

3876113151 · Jun 202019922001200920172026
48 results for mouse activity

Deep learning models outperform classical methods in forecasting neural activity.

problem Improving forecasting of neural activity using deep learning models.
method Systematic evaluation of eight probabilistic deep learning models against classical statistical models and baseline methods.
result Several deep learning models consistently outperform classical approaches in forecasting neural activity.

This research uses Siamese networks to identify partial mouse brain images from the Allen atlas.

problem Identifying precise mouse brain microscopy images from the Allen atlas.
method Siamese Networks with contrastive learning to find corresponding atlas plates for partial images.
result Siamese CNNs achieved 25% TOP-1 and 100% TOP-5 accuracy in identifying brain slices from the Allen atlas.

New ensemble models classify mouse movement trajectories to assess survey question difficulty.

problem Assessing survey question difficulty based on respondents' interaction data.
method Ensemble models combining semi-metric-based weak learners to classify multivariate functional data.
result Improved survey data quality through better identification of respondent difficulty.

Identification of patterns from discrete data time-series for statistical inference, threat detection, social opinion dynamics, brain activity prediction has received recent momentum. In addition to the huge data size, the associated challenges are, for example, (i) missing data to construct a closed time-varying compl…

2018-11-02abs ↗pdf ↗

Active learning method for neural population dynamics using optogenetics.

problem Efficiently selecting neurons to stimulate for identifying neural population dynamics.
method Developed active learning procedure for low-rank regression to determine informative photostimulation patterns.
result Demonstrated a two-fold reduction in data required for predictive power using low-rank linear dynamical systems model.

TNDE quantifies dynamic gene drivers from single-cell snapshots.

problem Reconstructing time-resolved regulatory effects in biological processes.
method Time-varying Network Driver Estimation (TNDE) using shared graph attention encoder and partial optimal transport.
result TNDE identifies stage-specific driver genes in mouse erythropoiesis.

Graph auto-encoder predicts unobserved node features from biological networks and omics data.

problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.

Many real-valued stochastic time-series are locally linear (Gassian), but globally non-linear. For example, the trajectory of a human hand gesture can be viewed as a linear dynamic system driven by a nonlinear dynamic system that represents muscle actions. We present a mixed-state dynamic graphical model in which a hid…

2013-01-23abs ↗pdf ↗

Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can be expressed as a combination of these patterns. We introduce the OrMachine, a probabilistic genera…

2017-02-20abs ↗pdf ↗

Paper analyzes adversarial attacks and defenses using game theory.

problem Unclear conditions for optimal attacks and defenses in adversarial learning.
method Game-theoretic framework with locally linear decision boundary model.
result Fast Gradient Method attack and Randomized Smoothing defense form a Nash Equilibrium.

We describe a procedure to deform cubulations of hyperbolic groups by "bending hyperplanes". Our construction is inspired by related constructions like Thurston's Mickey Mouse example, walls in fibred hyperbolic 33-manifolds and free-by-Z\mathbb Z groups, and Hsu-Wise turns. As an application, we show that every coco…

2019-12-23abs ↗pdf ↗

Quantifying behavior is crucial for many applications in neuroscience. Videography provides easy methods for the observation and recording of animal behavior in diverse settings, yet extracting particular aspects of a behavior for further analysis can be highly time consuming. In motor control studies, humans or other …

2018-04-09abs ↗pdf ↗

Sparse Convex Biclustering improves accuracy and robustness in high-dimensional datasets.

problem Challenges in clustering rows and columns of large-scale datasets due to noise and computational complexity.
method Sparse Convex Biclustering (SpaCoBi) using convex optimization and stability-based tuning.
result Significantly outperforms state-of-the-art methods in accuracy for high-dimensional datasets.

ODBAE detects complex phenotypes in biological data.

problem Challenges in identifying complex phenotypes from high-dimensional biological data.
method ODBAE (Outlier Detection using Balanced Autoencoders) identifies influential and high leverage points in latent relationships among multiple physiological parameters.
result ODBAE reveals novel metabolism-related genes and uncovers coordinated abnormalities across metabolic indicators.

In statistical connectomics, the quantitative study of brain networks, estimating the mean of a population of graphs based on a sample is a core problem. Often, this problem is especially difficult because the sample or cohort size is relatively small, sometimes even a single subject. While using the element-wise sampl…

2016-09-06abs ↗pdf ↗

Bayesian method learns graph structures from Gaussian data efficiently.

problem Scalability issue in Bayesian Gaussian graphical model inference.
method Marginal pseudo-likelihood, birth-death and reversible jump MCMC algorithms.
result Efficient graph structure learning for large graphs with over 1,000 nodes.

Many activation functions have been proposed in the past, but selecting an adequate one requires trial and error. We propose a new methodology of designing activation functions within a neural network at each layer. We call this technique an "activation ensemble" because it allows the use of multiple activation functio…

2017-02-24abs ↗pdf ↗

This paper studies activation sparsity in large language models, finding key trends and implications.

problem Activation sparsity in large language models (LLMs) can be improved for efficiency and interpretability.
method Proposes PPL-p%p\% sparsity, analyzes trends with training data, width-depth ratio, and parameter scale.
result ReLU is more efficient for sparsity than SiLU, and deeper architectures can improve sparsity.