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

65130195260 · Jun 202019922001200920172026
48 results for cell weight

Method improves microbial biomass yield estimation from noisy data.

problem Estimating microbial biomass yields from noisy cell counts and substrate measurements.
method Probabilistic macrochemical modeling to relax cell weight assumptions and improve robustness.
result Model provides accurate uncertainty estimates of key parameters.

CST-YOLO improves blood cell detection with YOLOv7 and CNN-Swin Transformer.

problem Small-scale object detection in blood cells.
method YOLOv7 architecture enhanced with CNN-Swin Transformer, W-ELAN, MCS, CatConv.
result CST-YOLO achieves 92.7%, 95.6%, and 91.1% mAP@0.5 on three blood cell datasets.

We establish the Gaussian Multi-Bubble Conjecture: the least Gaussian-weighted perimeter way to decompose Rn\mathbb{R}^n into qq cells of prescribed (positive) Gaussian measure when 2qn+12 \leq q \leq n+1, is to use a "simplicial cluster", obtained from the Voronoi cells of qq equidistant points. Moreover, we prove that…

2018-05-28abs ↗pdf ↗

Study improves scalability of cell-free massive MIMO networks by optimizing UE-AP association.

problem Optimizing UE-AP association in cell-free massive MIMO networks.
method Deep learning algorithm using Bidirectional Long Short-Term Memory cells and hybrid probabilistic weight updating.
result Enhanced scalability without retraining, robust against pilot contamination.

Recently V. Krushkal and D. Renardy generalized the Tutte polynomial from graphs to cell complexes. We show that evaluating this polynomial at the origin gives the number of cellular spanning trees in the sense of A. Duval, C. Klivans, and J. Martin. Moreover, after a slight modification, the Tutte-Krushkal-Renardy pol…

2012-04-16abs ↗pdf ↗

We introduce Independently Recurrent Long Short-term Memory cells: IndyLSTMs. These differ from regular LSTM cells in that the recurrent weights are not modeled as a full matrix, but as a diagonal matrix, i.e.\ the output and state of each LSTM cell depends on the inputs and its own output/state, as opposed to the inpu…

2019-03-19abs ↗pdf ↗

The study analyzes local minima in ReLU networks and finds low probability of bad local minima.

problem Understanding the existence and probability of local minima in ReLU networks.
method Theoretical analysis combined with linear programming and experiments on MNIST and CIFAR-10 datasets.
result No bad differentiable local minima found almost everywhere in weight space.

Proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

problem Existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.
method Construct an isotopic map instead of edge-flipping algorithm, generalizing Dyer et al's method.
result Strict proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

Recurrent Neural Networks (RNN), Long Short-Term Memory Networks (LSTM), and Memory Networks which contain memory are popularly used to learn patterns in sequential data. Sequential data has long sequences that hold relationships. RNN can handle long sequences but suffers from the vanishing and exploding gradient probl…

2019-04-18abs ↗pdf ↗

Develops a machine learning method for parameter estimation in branching processes models.

problem Parameter evaluation for unevenly distributed sparse and dense regions in stochastic datasets.
method Approximate Bayesian computation based on Isolation Kernel mapping and maxima weighted kernel.
result Effective parameter estimation for cancer cell evolution models using personal data.

Optimal discrete harmonic maps between hyperbolic surfaces are found via minimizing energy.

problem Finding optimal discrete harmonic maps between hyperbolic surfaces.
method Minimizing Dirichlet energy over all possible hyperbolic structures and realizations within a fixed homotopy class.
result At the optimal hyperbolic structure, the discrete harmonic map and edge weights are induced from a weighted Delaunay decomposition.

LOT framework embeds high-dimensional cell data into interpretable Euclidean space.

problem Lack of interpretable methods for high-dimensional cell data.
method Adapts Linear Optimal Transport (LOT) to irregular point clouds.
result Accurate and interpretable classification and synthetic data generation.

Forest Fire Clustering discovers cell types from single-cell data.

problem Discovering cell types from large-scale single-cell sequencing data.
method Iterative label propagation and parallelized Monte Carlo simulation.
result Forest Fire Clustering outperforms state-of-the-art methods on diverse benchmarks.

Proposes CCCVAE for better single-cell clustering with cell-cell communication.

problem Improving single-cell RNA sequencing clustering by incorporating cell-cell communication.
method Integrates cell-cell communication into a variational autoencoder framework.
result Empirical results show CCCVAE outperforms standard VAEs in clustering performance.

Matching cells over time has long been the most difficult step in cell tracking. In this paper, we approach this problem by recasting it as a classification problem. We construct a feature set for each cell, and compute a feature difference vector between a cell in the current frame and a cell in a previous frame. Then…

2012-07-13abs ↗pdf ↗

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.

SOCP uses SOM to find groups and local calibration buffers for better regional coverage.

problem Heterogeneous regional coverage gaps in conformal prediction.
method Self-Organizing Map (SOM) for group discovery; local calibration buffers at BMU or fixed grid.
result Reduces regional coverage gaps on 7/8 benchmarks by 7.1%.

The study identifies all possible vector field structures on specific 2D shapes.

problem Optimal discrete gradient vector fields on surfaces with 1-2 critical cells.
method Analysis of discrete vector fields on 2D shapes with minimal critical cells.
result All possible structures of discrete Morse functions on specified shapes.

We establish the Gaussian Double-Bubble Conjecture: the least Gaussian-weighted perimeter way to decompose Rn\mathbb{R}^n into three cells of prescribed (positive) Gaussian measure is to use a tripod-cluster, whose interfaces consist of three half-hyperplanes meeting along an (n2)(n-2)-dimensional plane at 120120^{\circ}

2018-01-28abs ↗pdf ↗

New model identifies cell-specific genes for cancer prognosis.

problem No statistical model to integrate multiscale cancer data.
method Bayesian generalized promotion time cure models (GPTCMs).
result Improves cancer prognosis by identifying cell-specific genes.

MarkerMap selects key genes for cell type analysis in single-cell RNA-seq.

problem Selecting informative genes from large single-cell RNA-seq datasets is challenging and computationally intensive.
method MarkerMap is a generative model that identifies minimal gene sets explaining cell type variability.
result MarkerMap outperforms existing methods in both supervised and unsupervised marker selection.

New metric scores perturbations across populations, not cells, improving model comparison.

problem Single-cell perturbation data overlaps, making per-cell accuracy unreliable.
method Average per-cell probability vectors over all cells of a perturbation to form a population profile and rank candidate perturbations.
result Classifier Discrimination Score (CDS) identifies true perturbation more reliably than pseudobulk-based scores.

The process of morphogenesis, which can be defined as an evolution of the form of an organism, is one of the most intriguing mysteries in the life sciences. It is clear, that gene expression patterns cannot explain the development of the precise geometry of an organism and its parts in space. Here, we suggest a set of …

2012-05-05abs ↗pdf ↗

V1 cortex reconstructs images as Poisson equation solutions with varying weights.

problem Reconstructing images from V1 cortical cell receptive profiles.
method Solves a heterogeneous Poisson equation with varying weights representing neural connectivity.
result Reconstructions converge to homogeneous solutions using homogenization techniques.

NESS improves neighbor embedding for smooth cell-state transitions in single-cell data.

problem Challenges in extracting smooth, low-dimensional representations from noisy single-cell data.
method Builds on PCS framework to develop NESS, a stable machine learning approach.
result NESS consistently yields useful biological insights across diverse single-cell datasets.

New model clusters cells and individuals, revealing genetic influences on cell types.

problem Clustering nested data with group-level and observation-level variables.
method Nested Atoms Model (NAM), Bayesian nonparametric approach.
result Identifies clusters of genetically similar individuals with homogeneous cell-type profiles.

New method classifies reticulocytes from red blood cells without labels.

problem Classifying reticulocytes from mature red blood cells without fluorescent labels.
method Unsupervised machine learning on morpho-rheological markers.
result Promising results in classifying reticulocytes from mature red blood cells.

For a finite family of 3-dimensional almost contact metric manifolds with closed the structure form ηη is described a construction of an almost contact metric manifold, where the members of the family are building blocks - cells. Obtained manifold share many properties of cells. One of the more important are nullity c…

2012-03-21abs ↗pdf ↗

PolyILR: A Tree-Structured Orthonormal Decomposition of Compositional Data

problem Representing compositional data with hierarchical structure
method PolyILR: A canonical orthonormal decomposition of the Aitchison tangent space aligned with any tree topology
result PolyILR yields stable, interpretable features and enables inference at multiscale tree resolution