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

Trend · papers per month

1.8%3.7%5.5%7.3% · Apr 199819922001200920172026
48 results for plant growth

Deep learning predicts plant growth and yield in greenhouses.

problem Predicting plant growth and yield for better greenhouse management.
method Utilized a new deep recurrent neural network (RNN) with LSTM neurons to model growth parameters.
result Deep learning models outperformed traditional ML methods in predicting plant growth and yield.

Framework generates realistic crop images for growth modeling.

problem Modeling crop growth over time with precision and detail.
method Two-stage framework: image prediction and growth estimation models.
result Framework accurately predicts crop images with varying conditions.

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.

We address the question of the growth of firm size. To this end, we analyze the Compustat data base comprising all publicly-traded United States manufacturing firms within the years 1974-1993. We find that the distribution of firm sizes remains stable for the 20 years we study, i.e., the mean value and standard deviati…

1997-02-10abs ↗pdf ↗

In this paper we look at ergodic BSDEs in the case where the forward dynamics are given by the solution to a non-autonomous (time-periodic coefficients) Ornstein-Uhlenbeck SDE with Lévy noise, taking values in a separable Hilbert space. We establish the existence of a unique bounded solution to an infinite horizon disc…

2014-06-17abs ↗pdf ↗

Iran's FiT policy boosts REs but risks financial crisis and plant failure.

problem Financial challenges in maintaining renewable energy growth after policy targets.
method System dynamics model considering budget status, social tolerance, and investor trust.
result Adjusting tax on electricity consumption based on budget status prevents financial crises and maintains stable growth.

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 ↗

Gradient descent trains both layers of a ReLU network to fit a linear model.

problem Training dynamics of a ReLU network to fit a linear target function.
method Jointly training both layers of a one-hidden-layer ReLU network in a realizable setting with Gaussian inputs and labels.
result Gradient descent from a small random initialization converges to a global minimizer at a linear rate with optimal sample complexity.

The main result of this article is that if a 33-manifold MM supports an Anosov flow, then the number of conjugacy classes in the fundamental group of MM grows exponentially fast with the length of the shortest orbit representative, hereby answering a question raised by Plante and Thurston in 1972. In fact we show th…

2015-05-29abs ↗pdf ↗

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.

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.

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.

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 ↗

Paper shows statistical-computational gaps in learning sparse mixtures and robust estimation.

problem Statistical-computational gaps in learning sparse mixtures and robust estimation.
method Average-case reduction techniques, Imbalanced Sparse Gaussian Mixtures, and algorithmic change of measure.
result New hardness results for robust sparse mean estimation, semirandom planted dense subgraph, and universality principle for sparse mixture problems.

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.

A neural collaborative filtering method predicts corn hybrid yield performance.

problem Predicting yield performance of untested hybrid combinations in plant breeding.
method Ensemble of matrix factorization and neural networks.
result The model significantly outperformed other models in the Syngenta Crop Challenge.

The recent liberalization of the electricity and gas markets has resulted in the growth of energy exchanges and modelling problems. In this paper, we modelize jointly gas and electricity spot prices using a mean-reverting model which fits the correlations structures for the two commodities. The dynamics are based on Or…

2009-10-01abs ↗pdf ↗

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.

A controller learns to control a nonlinear plant with unknown model and partial observation using continuous deep Q-learning.

problem Designing a controller for a nonlinear plant with unknown model and partial sensor observation under network delays.
method Continuous deep Q-learning applied to an extended state including past control inputs and outputs.
result The controller can learn a robust control policy to network delays with partial sensor observation.

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.

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.