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

99198296395 · Jun 202019922001200920172026
48 results for plant classification

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 ↗

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.

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.

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.

Availability of an explainable deep learning model that can be applied to practical real world scenarios and in turn, can consistently, rapidly and accurately identify specific and minute traits in applicable fields of biological sciences, is scarce. Here we consider one such real world example viz., accurate identific…

2017-10-24abs ↗pdf ↗

This paper improves prediction accuracy for multi-input classification tasks using p-value aggregation.

problem Generating accurate predictive sets with guaranteed coverage for multi-input classification tasks.
method Integrates p-values from each observation to reduce the size of the predicted label set while maintaining class-conditional coverage.
result The method reduces the size of the predicted label set while preserving the required coverage guarantee.

GANs improve anomaly detection in power plants, achieving nearly perfect classification.

problem Anomaly detection in power generation plants to identify irregularities.
method Used Generative Adversarial Networks (GANs) for anomaly detection in power generation plants.
result GANs achieved an accuracy rate of 98.99% in anomaly detection, significantly improved by data augmentation.

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.

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 ↗

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.

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.

Geometric arguments show simplicial arrangements with few double points can't have an irreducible cubic curve dual.

problem Classifying simplicial arrangements with a linear bound on double points.
method Geometric arguments and structure theorem from Green and Tao.
result Simplicial arrangements with few double points can't have an irreducible cubic curve dual.

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.

A near-identity nilpotent pseudogroup of order m >= 1 is a family f_1, ..., f_n: (-1,1) -> R of C^2 functions for which: |f_i - id|_{C^1} < epsilon for some small positive real number epsilon < 1/10^{m+1} and commutators of the functions f_i of order at least m equal the identity. We present a classification of near-id…

2004-04-07abs ↗pdf ↗

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.

New AI method improves anomaly detection across different IIoT sensors.

problem Poor performance of anomaly detection models when applied to different machines.
method Robust AI method using pre-processing and multiple models on different pumps.
result Models perform well across different environments and types of pumps.

In this paper, we investigate the multi-variate sequence classification problem from a multi-instance learning perspective. Real-world sequential data commonly show discriminative patterns only at specific time periods. For instance, we can identify a cropland during its growing season, but it looks similar to a barren…

2017-12-19abs ↗pdf ↗

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.

Machine learning predicts plant phenotypes from soil microbiome data.

problem Predicting plant phenotypes from soil microbiome data.
method Two models (random forest and Bayesian neural network) were used to predict plant phenotypes from soil properties and microbial population density.
result Human decisions and normalization strategies significantly impact model performance.