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

Trend · papers per month

7142027 · Jun 202019922001200920172026
48 results for cell repair

RVAE detects and repairs corrupted cells in mixed-type tabular data.

problem Outlier detection and repair in mixed-type tabular data.
method Robust Variational Autoencoder (RVAE) learns the joint distribution of clean data and identifies outlier cells.
result RVAE outperforms state-of-the-art methods in cell outlier detection and repair for tabular data.

In this study we model the warranty claims process and evaluate the warranty servicing costs under non-renewing and renewing free repair warranties. We assume that the repair time for rectifying the claims is non-zero and the repair cost is a function of the length of the repair time. To accommodate the ageing of the p…

2018-03-02abs ↗pdf ↗

Graph-based approach repairs programs from diagnostic feedback.

problem Learning to repair programs from limited labeled data and compiler error messages.
method Introduces program-feedback graph and graph neural network for reasoning, and self-supervised learning with unlabeled programs.
result DrRepair significantly outperforms prior work, achieving high repair rates.

MACER accelerates error repair by modularly identifying and applying fixes.

problem Automated compilation error repair for novice programmers.
method Modular segregation of repair process into identification and application, using discriminative learning techniques.
result MACER outperforms existing methods by 20% on popular errors and is competitive on all error types.

Due to its potential to improve programmer productivity and software quality, automated program repair has been an active topic of research. Newer techniques harness neural networks to learn directly from examples of buggy programs and their fixes. In this work, we consider a recently identified class of bugs called va…

2019-04-03abs ↗pdf ↗

New method to recover over-parameterized models corrupted during estimation.

problem Recovering statistical models corrupted after initial estimation.
method Robust estimation using over-parameterized models and redundancy.
result Stochastic gradient descent is well-suited for model repair, but sparsity is generally not repairable.

Proposes a method to repair arbitrage in option prices data.

problem Arbitrage in option price data can lead to poor performance or failure of financial applications.
method Formulates data repair as a linear programming (LP) problem to minimise price changes within bid and ask price bounds.
result The proposed method gives sparse perturbations on data and improves model calibration with enhanced robustness and reduced calibration error.

CLSVAE repairs systematic errors in images with minimal labeled data.

problem Repairing systematic errors in data, especially in images.
method CLSVAE models inliers as a smaller latent space representation, separating inlier and outlier patterns.
result CLSVAE achieves superior repairs with less than 2% labeled data, outperforming other methods.

REPAIR mitigates variance collapse to enable linear interpolation between SGD solutions.

problem Linear interpolation between SGD solutions is difficult due to variance collapse in permuted activations.
method REPAIR rescales preactivations of interpolated networks to mitigate variance collapse.
result 60%-100% relative barrier reduction across various architectures and tasks.

SnareNet adds repair layers to neural networks to ensure outputs meet physical constraints.

problem Unconstrained neural network predictions violate physical or safety requirements.
method SnareNet appends a differentiable repair layer that navigates constraints to produce feasible outputs.
result SnareNet consistently improves objective quality while satisfying constraints more reliably.

This paper presents a novel end-to-end approach to program repair based on sequence-to-sequence learning. We devise, implement, and evaluate a system, called SequenceR, for fixing bugs based on sequence-to-sequence learning on source code. This approach uses the copy mechanism to overcome the unlimited vocabulary probl…

2018-12-24abs ↗pdf ↗

CROP verifies clean prefixes in reasoning traces, improving downstream repair accuracy.

problem Uncertainty in reasoning traces prevents full certification of entire responses.
method CROP selects a calibrated threshold to certify the longest prefix with low risk proxies.
result CROP improves downstream repair accuracy by preserving valid reasoning and discarding misleading suffixes.

CASP improves portfolio optimization by considering asset covariance.

problem Infeasibility in cardinality-constrained portfolio optimization.
method CASP uses volatility-normalized selection and covariance-aware projection.
result CASP-Basic delivers lower portfolio variance than standard Euclidean repair.

We present a new application and covering number bound for the framework of "Machine Learning with Operational Costs (MLOC)," which is an exploratory form of decision theory. The MLOC framework incorporates knowledge about how a predictive model will be used for a subsequent task, thus combining machine learning with t…

2011-04-27abs ↗pdf ↗

The above named paper has been withdrawn. A colleague has observed a gap in the proof of isotopy invariance, which can be repaired by reducing the coefficients (which lie in (1/6)Z) of the antisymmetric kanji with chords incident with more than one component modulo 8Z. An analogous issue arises in considering the effec…

2005-10-20abs ↗pdf ↗

Many modern data-intensive computational problems either require, or benefit from distance or similarity data that adhere to a metric. The algorithms run faster or have better performance guarantees. Unfortunately, in real applications, the data are messy and values are noisy. The distances between the data points are …

2017-10-29abs ↗pdf ↗

The recent use of `Big Code' with state-of-the-art deep learning methods offers promising avenues to ease program source code writing and correction. As a first step towards automatic code repair, we implemented a graph neural network model that predicts token types for Javascript programs. The predictions achieve an a…

2019-05-16abs ↗pdf ↗

Framework detects and classifies multi-label RBC images from microscopic images.

problem Challenges in separating touching or overlapping cells for classification.
method Region proposal model + CNN feature extraction + multi-label prediction networks.
result Framework achieves good performance in automatic cell detection and classification.

This study reviews and evaluates clustering methods for single-cell RNA-seq data.

problem Identifying and characterizing novel cell types from single-cell RNA-seq data.
method Review and performance comparison of clustering methods.
result Performance comparison experiments on two datasets.

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.

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.

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 ↗

Algorithms learned from data are increasingly used for deciding many aspects in our life: from movies we see, to prices we pay, or medicine we get. Yet there is growing evidence that decision making by inappropriately trained algorithms may unintentionally discriminate people. For example, in automated matching of cand…

2017-08-02abs ↗pdf ↗

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.

We extend cell decomposition to moduli space of convex projective structures.

problem Cell decomposition of moduli space of convex projective structures.
method Use Fock and Goncharov's A\mathcal{A}-coordinates and edge-flipping algorithm.
result Holonomy groups are semi-arithmetic in many cases.

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.