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

Trend · papers per month

2579 · Aug 201919922001200920172026
48 results for Planted substructures

STNN-DDI predicts drug interactions using substructure-aware neural networks.

problem Predicting drug-drug interactions (DDIs) to avoid side effects in poly-drug treatments.
method Designing a novel Substructure-ware Tensor Neural Network (STNN-DDI) that learns a 3-D tensor of substructure-substructure interactions.
result Significant improvement in AUC, AUPR, Accuracy, and Precision compared to state-of-the-art models.

Molecule optimization is about generating molecule YY with more desirable properties based on an input molecule XX. The state-of-the-art approaches partition the molecules into a large set of substructures SS and grow the new molecule structure by iteratively predicting which substructure from SS to add. However, s…

2019-11-23abs ↗pdf ↗

DHGAK aligns substructures for better graph kernel performance.

problem Limited performance of traditional graph kernels due to missing substructure similarities.
method Hierarchically aligns relational substructures in deep embedding space, assigning same feature maps in RKHS.
result DHGAK outperforms state-of-the-art graph kernels on various benchmarks.

The ability to detect and count certain substructures in graphs is important for solving many tasks on graph-structured data, especially in the contexts of computational chemistry and biology as well as social network analysis. Inspired by this, we propose to study the expressive power of graph neural networks (GNNs) v…

2020-02-10abs ↗pdf ↗

Graph Substructure Networks (GSN) improves GNN expressivity by counting subgraph isomorphisms.

problem Limited expressivity of GNNs in detecting and counting graph substructures.
method Topologically-aware message passing scheme based on substructure encoding.
result GSN is strictly more expressive than the Weisfeiler-Leman (WL) test and can disambiguate even hard graph isomorphism instances.

We analyze geometrical structures necessary to represent bulk and surface interactions of standard and substructural nature in complex bodies. Our attention is mainly focused on the influence of diffuse interfaces on sharp discontinuity surfaces. In analyzing this phenomenon, we prove the covariance of surface balances…

2004-06-18abs ↗pdf ↗

In a previous article, we defined a very flexible notion of suborbifold and characterized those suborbifolds which can arise as the images of orbifold embeddings. In particular, suborbifolds are images of orbifold embeddings precisely when they are saturated and split. This article addresses the problem of orbifold str…

2016-06-19abs ↗pdf ↗

Exact partitioning of high-order planted models achieved through convex optimization.

problem Efficiently partitioning hypergraphs generated by high-order planted models.
method Solving a computationally efficient convex optimization problem with a tensor nuclear norm constraint.
result Exact recovery of true underlying cluster structures with high probability.

Drug discovery aims to find novel compounds with specified chemical property profiles. In terms of generative modeling, the goal is to learn to sample molecules in the intersection of multiple property constraints. This task becomes increasingly challenging when there are many property constraints. We propose to offset…

2020-02-08abs ↗pdf ↗

Tackles the computational hardness of HPC detection, conjecturing equivalence to PC detection.

problem Computational hardness of hypergraphic planted clique detection.
method No specific method mentioned; focuses on conjecturing equivalence.
result Equivalence of computational hardness between HPC and PC detection.

Plants monitor their surrounding environment and control their physiological functions by producing an electrical response. We recorded electrical signals from different plants by exposing them to Sodium Chloride (NaCl), Ozone (O3) and Sulfuric Acid (H2SO4) under laboratory conditions. After applying pre-processing tec…

2017-05-13abs ↗pdf ↗

Geo2DR learns graph representations using substructure patterns.

problem Learning distributed representations of graphs efficiently.
method Unsupervised learning with discrete substructure patterns and neural language models.
result Geo2DR achieves high reproducibility and interoperability in graph classification.

Study connects database alignment and planted matching using Gaussian features.

problem Identify matching between correlated user features in anonymized databases.
method Derived results for database alignment and planted matching, showing connections and thresholds.
result Performance thresholds for database alignment converge to planted matching when feature dimensionality is sufficiently high.

SFP prunes ID features to improve OOD generalization without domain data.

problem Improving out-of-distribution (OOD) generalization in biased models.
method Spurious Feature-targeted model Pruning (SFP) framework.
result SFP achieves optimal OOD generalization by pruning ID features.

An important question that discrete approaches to quantum gravity must address is how continuum features of spacetime can be recovered from the discrete substructure. Here, we examine this question within the causal set approach to quantum gravity, where the substructure replacing the spacetime continuum is a locally f…

2006-04-28abs ↗pdf ↗

Random Planted Forest interprets tree-based models by keeping some splits, leading to more interpretable predictions.

problem Estimating the unknown regression function from lower-order interaction terms.
method Modifying the random forest algorithm by keeping certain leaves instead of deleting them, resulting in non-binary trees called planted trees.
result The random planted forest achieves asymptotically optimal convergence rates up to a logarithmic factor when the interaction bound is low.

The problem of accelerating drug discovery relies heavily on automatic tools to optimize precursor molecules to afford them with better biochemical properties. Our work in this paper substantially extends prior state-of-the-art on graph-to-graph translation methods for molecular optimization. In particular, we realize …

2019-06-11abs ↗pdf ↗

We consider the problem of online learning of optimal control for repeatedly operated systems in the presence of parametric uncertainty. During each round of operation, environment selects system parameters according to a fixed but unknown probability distribution. These parameters govern the dynamics of a plant. An ag…

2016-09-18abs ↗pdf ↗

Study information limits for community detection in sub-hypergraphs.

problem Identify limits for exact community detection in sub-hypergraphs.
method Use Fano's inequality to define model parameters and identify success and failure regions.
result Identify regions where algorithms succeed or fail in exact recovery.

Graph clustering involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular statistical setting for evaluating solutions to this problem is the stochastic block model, also referred to as the planted partition model…

2012-10-11abs ↗pdf ↗

Power plant is a complex and nonstationary system for which the traditional machine learning modeling approaches fall short of expectations. The ensemble-based online learning methods provide an effective way to continuously learn from the dynamic environment and autonomously update models to respond to environmental c…

2017-10-19abs ↗pdf ↗

Study compares GNNs and classical molecular featurisations for molecular property and cliff prediction.

problem Comparing GNNs and classical featurisations for molecular property and cliff prediction.
method Systematic exploration and comparison of PDVs, ECFPs, and GNNs; introduction of substructure pooling.
result Sort & Slice outperforms hash-based folding in ECFP vectorization.

Paper explores limits of high-order clustering with planted structures.

problem Statistical and computational limits of high-order clustering with planted structures.
method Developed methods for detection and recovery of clusters, identified signal-to-noise ratio boundaries.
result Sharp boundaries of signal-to-noise ratio for statistical and computational feasibility.

Develops a new Gaussian process method for efficient Bayesian inference of plant root parameters in the Richards equation.

problem Estimating unknown parameters in nonlinear PDEs for agricultural studies.
method Gaussian process collocation with importance sampling and Bayesian optimization.
result Our method yields robust estimates with uncertainty quantification for plant root parameters.

Interpretable neural network for plant traits and species identification.

problem Plant phenotyping and identification.
method Neural network trained on UPWINS spectral library, with visualization of weights for trait-based spectral features.
result 90% accuracy in species identification with interpretable neural network.

New method uses contrastively trained GNNs for more reliable graph model evaluation.

problem Need effective methods to evaluate Graph Generative Models.
method Use representations from contrastively trained Graph Neural Networks (GNNs) for evaluation.
result Contrastively trained GNNs provide more reliable evaluation metrics than traditional or GNN-based approaches.

The paper uses a graph autoencoder to learn unbiased plant-pollinator interaction embeddings.

problem Sampling bias in citizen science data affects ecological network analysis.
method Bipartite graph variational autoencoder with HSIC for fairness.
result The method mitigates sampling bias and provides unbiased embeddings.

We introduce the notion of left (and right) quasi-Loday algebroids and a "universal space" for them, called a left (right) omni-Loday algebroid, in such a way that Lie algebroids, omni-Lie algebras and omni-Loday algebroids are particular substructures.

2010-05-25abs ↗pdf ↗

Properties of data are frequently seen to vary depending on the sampled situations, which usually changes along a time evolution or owing to environmental effects. One way to analyze such data is to find invariances, or representative features kept constant over changes. The aim of this paper is to identify one such fe…

2012-03-01abs ↗pdf ↗

Study shows it's impossible to count communities without finding them.

problem Determining the number and sizes of communities in random graph models.
method Hypothesis testing between models with different community structures, using low-degree polynomial framework.
result Testing between two different planted distributions is as hard as finding the communities.