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

0.3%0.5%0.8%0.9% · Dec 200819922001200920182026
24 results for Drosophila

Study proposes curvature flow model for Drosophila dorsal closure.

problem Modeling and understanding Drosophila dorsal closure during embryonic development.
method Curvature-based mathematical model, analysis of maximum-principle and integral-estimates, numerical approximation scheme.
result Established global existence and convergence for the model.

We present semiparametric spectral modeling of the complete larval Drosophila mushroom body connectome. Motivated by a thorough exploratory data analysis of the network via Gaussian mixture modeling (GMM) in the adjacency spectral embedding (ASE) representation space, we introduce the latent structure model (LSM) for n…

2017-05-09abs ↗pdf ↗

The paper predicts responses on out-of-sample nodes using latent positions on unknown curves.

problem Predicting responses on out-of-sample nodes with latent positions on unknown curves.
method Manifold learning and graph embedding technique using latent positions.
result Convergence guarantees for predicting responses on out-of-sample nodes.

New method uses manifold learning to infer latent positions of 1D submanifolds in random dot product graphs.

problem Inference on latent positions of unknown 1D submanifolds in RDPGs.
method Apply Isomap for manifold learning to estimate arc lengths on the unknown submanifold.
result Test statistics based on Isomap converge to known submanifold power as auxiliary vertices increase.

Stochastic networks are a plausible representation of the relational information among entities in dynamic systems such as living cells or social communities. While there is a rich literature in estimating a static or temporally invariant network from observation data, little has been done toward estimating time-varyin…

2008-12-30abs ↗pdf ↗

The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision. We propose a solution to this problem via a graph matching matched filter: centering and padding…

2018-03-06abs ↗pdf ↗

The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic block models to complex latent position graphs. In this survey paper, we describ…

2017-09-16abs ↗pdf ↗

Random forest improves nearest neighbor estimation of information-theoretic quantities.

problem Estimating information-theoretic quantities in high-dimensional and scale-different settings.
method Decision forest-based adaptive nearest neighbor estimators.
result Forest-based estimators effectively estimate posterior probabilities and mutual information.

Develops statistical guarantees for image-to-image regression models.

problem Current image-to-image regression models lack statistical guarantees for model mistakes and hallucinations.
method Uncertainty quantification techniques with rigorous statistical guarantees for image-to-image regression problems.
result Derives uncertainty intervals around each pixel with formal mathematical guarantees.

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 ↗

BioHash improves similarity search performance using sparse high-dimensional hash codes.

problem Improving similarity search performance in high-dimensional data.
method BioHash produces sparse high-dimensional hash codes through a data-driven approach based on synaptic plasticity.
result BioHash outperforms previous hashing methods in various similarity search tasks.

A novel algorithm optimizes sparsity in reservoir computing inspired by insect brain.

problem Optimizing sparsity in reservoir computing networks.
method Inspired by insect brain, the algorithm optimizes sparsity levels by adjusting node firing thresholds.
result The algorithm outperforms standard gradient descent on tasks involving better classification, memorization, and convergence.

Controller-Augmented Hidden Markov Models (CHMMs) are a framework for constrained sequential inference.

problem Hidden Markov models fail under pathwise constraints like precedence, visitation, or monotonic state progression.
method CHMMs compile constraints into finite-state controllers, then use standard forward-backward and Viterbi recursions to compute exact constrained posteriors and paths.
result CHMMs provide exact constrained inference, monotone ascent in constrained EM, and linear complexity in controller cardinality.

Many applications donot have the benefit of the laws of physics to derive succinct descriptive models for observed data. In alternative, interdependencies among NN time series {xnk,k>0}n=1N\{ x_{nk}, k>0 \}_{n=1}^{N} are nowadays often captured by a graph or network GG that in practice may be very large. The network itself may …

2018-06-05abs ↗pdf ↗

New sparse CCA method finds interpretable associations in multi-view data.

problem Discovering interpretable associations in high-dimensional multi-view data.
method Inspired by sparse PCA, proposed a convex maximization program equivalent to non-convex sparse CCA formulation, using gradient method to reduce search space.
result Proposed two-step algorithm and new sparse CCA variants (Directed Sparse CCA, Multi-View sCCA) for multi-omic studies.