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

Trend · papers per month

1122 · Aug 201519922001200920182026
48 results for metabolizers

Bayesian analysis uncovers flux couplings in metabolic networks.

problem Uncertainty and unrealistic assumptions in traditional flux analysis methods.
method Introduces Bayesian metabolic flux analysis to model reactions probabilistically and infer flux distributions.
result Reveals informative flux couplings and more unobserved fluxes in metabolic networks.

AutoML enhances clinical metabolic profiling by adjusting for confounders.

problem Identifying and adjusting for clinical confounders in AutoML for metabolic profiling.
method Tandem rank-accuracy measure for feature selection, residual training adjustment for confounders.
result Increased homocysteine concentration associated with long-term metformin exposure.

In a classic paper Zeeman introduced the k-twist spin of a knot K and showed that the exterior of a twist spin fibers over S^1. In particular this result shows that the knot K # -K is doubly slice. In this paper we give a quick proof of Zeeman's result. The k-twist spin of K also gives rise to two metabolizers for K # …

2013-12-06abs ↗pdf ↗

The paper studies triple linking numbers of genus three knots and their derivatives.

problem Understanding triple linking numbers of genus three knots and their derivatives.
method Analyzes algebraically slice knots and their metabolizers to derive triple linking numbers.
result It is possible to realize any integer as a Milnor's triple linking number of a derivative of the unknot.

It is known that the linking form on the 2-cover of slice knots has a metabolizer. We show that several weaker conditions, or some other conditions related to sliceness, do not imply the existence of a metabolizer. We then show how the Rudolph-Bennequin inequality can be used indirectly to prove that some knots are not…

2004-12-14abs ↗pdf ↗

Poisson variational autoencoders introduce a metabolic cost term that penalizes high baseline activity.

problem Energy constraints in computation.
method Poisson variational autoencoders with a Kullback-Leibler divergence term proportional to firing rates.
result Poisson variational autoencoders introduce a metabolic cost term that penalizes high baseline activity.

For n >1, if the Seifert form of a knotted 2n-1 sphere K in S^{2n+1} has a metabolizer, then the knot is slice. Casson and Gordon proved that this is false in dimension three (n = 1). However, in the three dimensional case it is true that if the metabolizer has a basis represented by a strongly slice link then K is sli…

2000-07-14abs ↗pdf ↗

Study compares atom representations in graph neural networks for molecular properties.

problem Incorrect attribution of results in molecular property prediction due to varying atom features.
method Evaluated multiple atom representations on free energy, solubility, and metabolic stability predictions.
result Different atom representations can lead to varying predictive performance in graph neural networks.

The paper corrects a proof and extends a theorem about linking pairings in 4-manifolds.

problem Linking pairings in 4-manifolds and their properties.
method Analyzes the embedding of multiple copies of a 4-manifold in a compact 4-manifold and examines the resulting linking pairings.
result The linking pairing on the boundary of a 4-manifold is split metabolic, generalizing Hantzsche's theorem.

This work uses Sylvester normalizing flows for more accurate metabolite quantification in MRS.

problem Challenges in accurate metabolite quantification in MRS due to spectral overlap, low SNR, and artifacts.
method Bayesian inference framework with physics-informed Sylvester normalizing flows.
result Accurate metabolite quantification, well-calibrated uncertainties, and insights into parameter correlations and multi-modal distributions.

Deep learning models accurately recognize and estimate physical activity types and energy expenditure from wrist accelerometer data.

problem Rigorous evaluation of wrist-worn accelerometers for assessing physical activity across the lifespan.
method Built deep learning networks to extract spatial and temporal representations from time-series data, recognizing physical activity types and estimating energy expenditure.
result Deep learning models achieved high performance: F1 scores of 0.82, 0.81, and 95 for sedentary, locomotor, and lifestyle activities, respectively; root mean square error of 1.1 for EE estimation.

Novel method identifies proteomic risk markers for Alzheimer disease.

problem Lack of comprehensive proteomic risk markers for Alzheimer disease diagnosis.
method Deep belief network-based feature selection method using proteomic and clinical data.
result Identified an optimal subset of proteins achieving 90% accuracy in Alzheimer disease diagnosis.

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.

New algorithm reduces BO's computational burden for expensive experiments.

problem BO's computational cost is often ignored in practice, making it inefficient for time-consuming experiments.
method Introduces Dimension Scheduling Algorithm (DSA) to optimize BO for many experiments.
result DSA finds good solutions faster and reduces computation time compared to traditional BO.

The difference between slice and doubly-slice knots is reflected in algebra by the difference between metabolic and hyperbolic Blanchfield linking forms. We exploit this algebraic distinction to refine the classical Witt group of linking forms by defining a `double Witt group' of linking forms. We calculate the double …

2015-08-03abs ↗pdf ↗

Method predicts NAFLD risk with high accuracy and distribution-free coverage guarantees.

problem Insufficient population-level screening tools for NAFLD.
method Gradient-boosted decision trees with conformal prediction.
result Method achieves AUROC of 0.912 internally and 0.891 externally, superior to other models.

We develop a theory of chain complex double-cobordism for chain complexes equipped with Poincaré duality. The resulting double-cobordism groups are a refinement of Ranicki's torsion algebraic LL-groups for localisations of a commutative ring with involution. The refinement is analogous to the difference between metabo…

2015-08-05abs ↗pdf ↗

We define a set of "second-order" L^(2)-signature invariants for any algebraically slice knot. These obstruct a knot's being a slice knot and generalize Casson-Gordon invariants, which we consider to be "first-order signatures". As one application we prove: If K is a genus one slice knot then, on any genus one Seifert …

2008-08-11abs ↗pdf ↗

We introduce, test and discuss a method for classifying and clustering data modeled as directed graphs. The idea is to start diffusion processes from any subset of a data collection, generating corresponding distributions for reaching points in the network. These distributions take the form of high-dimensional numerica…

2014-08-21abs ↗pdf ↗

Clarifies the confidence interval approach for bioequivalence testing.

problem Ensuring the reliability of bioequivalence testing methods.
method Clarifies the conditions under which a 100(1-2α)% confidence interval yields a size-α test.
result A 100(1-2α)% confidence interval approach for bioequivalence testing yields a size-α test only when the two one-sided tests are 'equal-tailed'.

Paper introduces a novel framework for supervised graph prediction using Optimal Transport.

problem Supervised labeled graph prediction.
method Fused Gromov-Wasserstein (FGW) loss and FGW barycenter with neural network weights and learned graphs.
result The method can interpolate in the labeled graph space and achieve good performance on difficult problems.

Study improves LLMs for PPI analysis by addressing uncertainty.

problem Uncertainty in LLM predictions for PPIs.
method Fine-tuned LLaMA-3 and BioMedGPT models, LoRA ensembles, Bayesian LoRA for UQ.
result Competitive PPI identification performance across diverse disease contexts.

POEM predicts drug properties without tuning, outperforming other methods.

problem Predicting drug properties from molecular structures efficiently.
method POEM combines multiple molecular representations without hyperparameter tuning.
result POEM outperforms industry-standard methods across 17 tasks.

Networks have in recent years emerged as an invaluable tool for describing and quantifying complex systems in many branches of science. Recent studies suggest that networks often exhibit hierarchical organization, where vertices divide into groups that further subdivide into groups of groups, and so forth over multiple…

2008-11-04abs ↗pdf ↗

Deep learning predicts cognitive decline in MCI patients using brain imaging.

problem Identifying subjects at risk of rapid cognitive decline in mild cognitive impairment.
method Developed a deep convolutional neural network framework trained on baseline PET studies of AD and normal subjects.
result CNN-based approach accurately predicts conversion to Alzheimer's disease in MCI patients with high accuracy.

This research predicts diabetes mellitus using machine learning techniques.

problem Early prediction of diabetes mellitus to control and save human life.
method Exploring various risk factors related to diabetes using four machine learning algorithms (SVM, NB, KNN, C4.5 Decision Tree) on adult population data.
result C4.5 decision tree achieved higher accuracy in predicting diabetic mellitus.

Paper presents estimators for entropy and information in probabilistic models.

problem Estimating entropy and mutual information in high dimensions is challenging.
method EEVI uses importance sampling with proposal distributions like amortized variational inference and sequential Monte Carlo.
result EEVI delivers accurate upper and lower bounds on information quantities.

New method uses surrogate gradients to train efficient spiking networks on neuromorphic hardware.

problem Training high-performing spiking networks on analog neuromorphic hardware is challenging due to device mismatch and lack of efficient algorithms.
method Introduces a general in-the-loop learning framework based on surrogate gradients.
result Learning self-corrects for device mismatch, resulting in competitive spiking network performance.

Develops methods for GWAS of high dimensional phenotypes using summary statistics.

problem Lack of methods to model pleiotropy in multi-phenotype GWAS.
method Bayesian inference model using summary statistics, fast computation, and biologically informed priors.
result Demonstrates utility in metabolite GWAS with interpretable pathway-level inference.

Optimizes impression allocation for e-commerce platforms using reinforcement learning.

problem Short-term and long-term returns are not optimized in current e-commerce platform allocation mechanisms.
method Formal lifecycle model of products, reinforcement learning framework, first principal component based permutation, novel experiences generation method.
result Significant improvement in platform and participant health with optimized impression allocation.

Deep neural networks classify T2D from retinal images with high accuracy.

problem Detecting early-stage Type 2 Diabetes from retinal images.
method Employed deep neural networks and multi-target learning to differentiate T2D from healthy individuals.
result Classification performance improved to AUC = 0.758 [±\pm0.003] using images from both eyes.

Machine learning detects subtle glucose changes for early diabetes diagnosis.

problem Challenging early-stage diabetes diagnosis due to subtle glucose changes.
method Applied machine learning to synthetic glucose profiles generated by a biophysical model.
result High accuracy (above 85%) in detecting insulin resistance using various neural networks.