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

4793140186 · May 202619922001200920172026
48 results for planted matching

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.

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 ↗

Study on matching nodes between graphs to preserve edges, focusing on limits and algorithms.

problem Matching nodes between graphs to preserve most edges, especially in random graphs.
method Investigates fundamental limits and designs algorithms to recover alignments in planted graphs.
result High probability guarantees on the success or failure of graph alignment algorithms.

Study matches two noisy point clouds with geometric transformations and relabeling.

problem Matching two noisy point clouds with orthogonal transformations and relabeling.
method Information-theoretic results and Ping-Pong algorithm for computational alignment.
result The Ping-Pong algorithm retrieves the planted signal after one step.

Consistent spectral clustering with fairness constraints on representation graphs.

problem Finding balanced clusters in similarity graphs with fairness constraints.
method Developed variants of unnormalized and normalized spectral clustering for fair planted partitions.
result Consistency results for constrained spectral clustering under fair planted partitions.

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.

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 ↗

Detecting a planted submatrix in random matrices with non-asymptotic methods.

problem Detecting a planted submatrix in random matrices with non-zero entries.
method Established minimax lower bounds and derived optimal tests for distinguishing the null and alternative hypotheses.
result Non-asymptotic upper and lower bounds match for any configuration of matrix dimensions.

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.

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.

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 ↗

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.

QAOA matches classical tensor power iteration in spiked tensor model recovery.

problem Statistical estimation in spiked tensor model with computational gap.
method Analysis of QAOA performance on spiked tensor model.
result QAOA weak recovery threshold matches tensor power iteration.

This paper tackles matching two complete graphs with correlated edge weights in geometric models.

problem Matching two complete graphs with edge weights correlated through latent geometries.
method Derives an approximate maximum likelihood estimator for recovering hidden vertex correspondence.
result The estimator provably achieves perfect recovery under certain noise conditions.

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.

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.

Study reconstructs hidden perfect matchings in random graphs with specific edge weights.

problem Reconstructing hidden perfect matchings in random weighted bipartite graphs.
method Analyzes the maximum likelihood estimator for matching reconstruction under different probability distributions of edge weights.
result Sharp threshold and infinite-order phase transition in reconstruction error for different probability distributions.

Graph neural networks help assess how global changes affect plant-pollinator networks.

problem Interpreting GNN results to understand how global changes impact plant-pollinator networks.
method Simulation study and application on Spipoll dataset to assess effects of global changes on pollination networks.
result GNNs can detect interactive effects between covariates and plant genera on pollination network connectivity.

Study on Langevin dynamics for recovering planted signals in spiked matrix models.

problem Recovering a planted signal in spiked matrix models.
method Path-wise characterization of overlap using integro-differential equations and explicit formula derivation.
result Sharp phase transition in limiting overlap: positive in one regime, zero in another due to injected noise.

Detection of dense cycles in graphs reveals a gap between easy detection and hard recovery.

problem Detecting and recovering dense cycles in Erdős-Rényi graphs.
method Characterization of computational thresholds for detection and recovery using low-degree polynomial algorithms.
result A gap exists between the detection and recovery thresholds for certain parameter regimes.

Deep semi-supervised learning identifies tree species from natural images.

problem Identifying tree species in natural settings with limited labeled data.
method Two-fold approach using deep semi-supervised learning.
result Achieves 94.04% top-5 accuracy for leaves and 83.04% for bark.