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

1122 · Dec 200219922001200920172026
33 results for aqueous solubility

Framework separates chemical and structural contributions to aqueous solubility.

problem Merging chemical and structural information in solubility models obscures their relative importance.
method Additive MLP-GNN framework with separate chemical and structural branches.
result Framework reveals distinct roles of chemical and structural information in solubility.

A framework separates chemical and structural contributions to aqueous solubility.

problem Merging chemical and structural information in solubility models obscures their relative contributions.
method Additive MLP-GNN framework with separate chemical and structural branches.
result Framework reveals distinct roles of chemical and structural information in solubility.

It is known that every ribbon category with unimodality allows symmetrized 6j6j-symbols with full tetrahedral symmetries while a spherical category does not in general. We give an explicit counterexample for this, namely the category E\mathcal{E}. We define the mirror conjugate symmetry of 6j6j-symbols instead and sho…

2009-07-13abs ↗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.

We give an overview about finiteness properties of soluble S-arithmetic groups. Both, the number field case and the function field case are covered. The main result is: If B is a Borel subgroup in a Chevalley group and R is an S-arithmetic ring, then the group B(R) has finiteness length |S|-1 in the function field case…

2002-12-29abs ↗pdf ↗

Let (Mn,g0)(M^{n},g_{0}) be a n=3,4,5n=3,4,5 dimensional, closed Riemannian manifold of positive Yamabe invariant. For a smooth function K>0K>0 on MM we consider a scalar curvature flow, that tends to prescribe KK as the scalar curvature of a metric gg conformal to g0g_{0}. We show global existence and in case MM is not confo…

2015-09-02abs ↗pdf ↗

Local solubility of Bao--Ratiu equations proven for surfaces with specific curvature conditions.

problem Existence of asymptotic directions for volume-preserving diffeomorphisms on surfaces.
method Analysis of degenerate Monge--Ampère equation following Han's work.
result Asymptotic directions always exist locally about a point on surfaces with specific curvature conditions.

Sharp regularity for Pfaff system leads to isometric immersions in arbitrary dimensions.

problem Existence and regularity of isometric immersions in arbitrary dimensions.
method Proving W1,2W^{1,2}-regularity for Pfaff system with antisymmetric L2L^2-coefficient matrix.
result Equivalence between W2,2W^{2,2}-isometric immersions and weak solubility of Gauss--Codazzi--Ricci equations.

Complete criterion for VoI in multi-decision influence diagrams established.

problem Analyzing safety and fairness properties of AI systems using influence diagrams.
method Introduced ID homomorphisms and Tree of Systems to prove properties of multi-decision influence diagrams.
result First complete graphical criterion for VoI in influence diagrams with multiple decisions.

The efficacy of family-based approaches to mixture model-based clustering and classification depends on the selection of parsimonious models. Current wisdom suggests the Bayesian information criterion (BIC) for mixture model selection. However, the BIC has well-known limitations, including a tendency to overestimate th…

2012-11-27abs ↗pdf ↗

We prove that the profinite completion of the fundamental group of a compact 3-manifold MM satisfies a Tits alternative: if a closed subgroup HH does not contain a free pro-pp subgroup for any pp, then HH is virtually soluble, and furthermore of a very particular form. In particular, the profinite completion of th…

2014-11-19abs ↗pdf ↗

Manifold methods improve amino acid classification in LIBS spectra.

problem Improving classification accuracy of amino acids in LIBS spectra.
method Developed an information theoretic method for measuring LIBS energy spectra, implemented manifold methods for nonlinear dimensionality reduction.
result Nonlinear methods lead to increased classification accuracy in amino acid classification.

Graph networks struggle with multi-task learning due to varying property loss surface curvatures.

problem Graph networks underperform in multi-task learning for crystal and molecule properties.
method Assessed curvature of property loss surfaces via spectral properties of Hessians, matrix-free using randomized numerical linear algebra.
result Varying curvature of property loss surfaces explains graph networks' multi-task learning inefficiency.

Novel deep learning method predicts reaction coordinates and future MD trajectories.

problem Identifying optimal reaction coordinates for chemical reactions.
method Regularized Sparse Autoencoder (RSE) for discovering reaction coordinates and predicting MD trajectory evolution.
result RSE helps in choosing a small but important set of reaction coordinates.

Recently, machine learning (ML) has established itself in various worldwide benchmarking competitions in computational biology, including Critical Assessment of Structure Prediction (CASP) and Drug Design Data Resource (D3R) Grand Challenges. However, the intricate structural complexity and high ML dimensionality of bi…

2019-12-03abs ↗pdf ↗

This work improves molecular design by efficiently selecting diverse candidate molecules.

problem Designing molecules that satisfy multiple conflicting objectives.
method A modular 'generate-then-optimize' framework using generative models and a novel acquisition function.
result Significant improvements in sample efficiency across synthetic and application-driven tasks.

The paper proves unboundedness of a functional on G2 forms and describes manifold limits.

problem Proving unboundedness of a functional on G2 forms and describing manifold limits.
method Scaling arguments, geometric estimates, collapsing theorem for orbifolds.
result Explicit descriptions of large volume limits of two G2 manifolds.

Superintegrable systems are classical and quantum Hamiltonian systems which enjoy much symmetry and structure that permit their solubility via analytic and even, algebraic means. They include such well-known and important models as the Kepler potential, Calogero-Moser model, and harmonic oscillator, as well as its inte…

2012-09-25abs ↗pdf ↗

Extending isometric immersions with low regularity, especially supercritical.

problem Finding isometric immersions with low regularity in Euclidean space.
method Utilising Uhlenbeck gauges and compensated compactness theory.
result Existence of isometric immersions with low regularity, including supercritical cases.

ProtTrans models predict protein features without evolutionary info.

problem Predicting protein features from amino acid sequences.
method Self-supervised deep learning on large protein datasets.
result ProtT5 embeddings outperform state-of-the-art for per-residue predictions.

DOCKSTRING simplifies docking simulations for better drug design benchmarks.

problem Lack of meaningful benchmarks for ligand design.
method Open-source Python package for docking scores, extensive dataset, and pharmaceutically-relevant tasks.
result Docking scores are more appropriate benchmarks than simple physicochemical properties.

Extract common latent factors from graphs for better representation learning.

problem Graph-level representation learning challenges due to limited labeled data and poor negative sample selection.
method Graph-wise Common Latent Factor Extraction (GCFX) using deepGCFX model.
result Improved graph-level and node-level tasks performance compared to state-of-the-art methods.