Study homological stabilization in Hurwitz spaces using plant complexes.
problem Homological stabilization in Hurwitz spaces with specific properties.
method Introduce plant complexes and generalize Ellenberg-Venkatesh-Westerland result.
result Homological stabilization depends only on zeroth homology groups.
New insights link diverse statistical problems via secret leakage planted clique.
problem Statistical-computational gaps in inference problems.
method Secret leakage planted clique as a new hardness assumption for reductions.
result Establishes tight statistical-computational tradeoffs for various problems.
Paper proposes online learning method for power plant performance modeling.
problem Traditional machine learning models fail to handle nonstationary power plant dynamics.
method Ensemble-based online learning approach to continuously update models.
result Achieves less than 1% MAPE on real data, improving performance in field operations.
AI system synthesizes chemical plant operation procedures for efficiency and stability.
problem Developing efficient and stable operation procedures for complex chemical plants.
method Integrates automated reasoning, deep reinforcement learning, and dynamic simulation with external knowledge.
result Synthesized procedure achieves faster recovery from malfunctions compared to standard PID control.
Paper classifies plant electrical signals to identify external stimuli.
problem Classifying external stimuli using plant electrical response.
method Computed 11 statistical features from plant electrical signals and used discriminant analysis.
result Raw electrical signals contain enough information for stimulus classification.
We consider two closely related problems: planted clustering and submatrix localization. The planted clustering problem assumes that a random graph is generated based on some underlying clusters of the nodes; the task is to recover these clusters given the graph. The submatrix localization problem concerns locating hid…
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.
Paper compares decision tree-based classification for detecting plant electrical signals from NaCl, O3, and H2SO4.
problem Detecting external chemical stimuli from plant electrical signals.
method Extracted features from filtered and raw plant electrical signals, used decision tree-based multi-class classification.
result Optimized feature and classifier combinations for distinguishing chemical stimuli.
The paper uses VGG-19 for plant species classification from leaf images.
problem Manual inspection of plant species by botanists is time-consuming.
method Transfer learning with VGG-19 for feature extraction and classification.
result The model achieves 99.70% accuracy in predicting plant species.
Spectral algorithms solve optimal community detection and related problems.
problem Optimal detection of community structures and related substructures.
method Spectral algorithms applied to various planted substructures.
result Spectral algorithms achieve optimal performance for a wide range of planted substructures.
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.
New algorithm improves plant breeding by clustering soybean genotypes more accurately and efficiently.
problem Low accuracy and high computational complexity in clustering plant genotypes.
method Spectral Clustering with Pivotal Sampling for phenotypic data.
result Our algorithm achieves substantially more accuracy than existing methods.
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.
New findings on computational limits for estimating hidden structures.
problem Estimating hidden structures in noisy data.
method Use of low-degree polynomials as a restricted model of computation.
result Established low-degree hardness of recovery problems for easy detection problems.
Paper proposes a new KPI for early fault detection in hydropower plants.
problem Early detection and maintenance of faults in hydropower plants.
method Developed and tested a novel Key Performance Indicator (KPI).
result The KPI outperforms conventional multivariable process control charts.
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.
Agent learns optimal control inputs for plants with unknown parameters.
problem Optimal control for systems with unknown and changing parameters.
method Personalized control inputs based on stochastic dynamics.
result Demonstrated effectiveness on simulated system.
Study compares WTT and DWT for FTIR data feature extraction of medicinal plants.
problem Improving machine learning efficiency with FTIR spectra of medicinal plants.
method Comparison of WTT and DWT for feature extraction, varying preprocessing steps.
result WTT and DWT yield similar results, improving clustering and classification accuracy.
Paper compares simple and complex forecasting methods for photovoltaic power generation.
problem Improving accuracy of power generation forecasts from photovoltaic plants.
method Compared simple and sophisticated forecasting methods over 32 plants.
result Simpler methods are sufficient for accurate forecasts, but weather impacts are significant.
Paper proposes machine learning for industrial plant fault prediction.
problem Fault detection in industrial plants using sensor data.
method Classification methods like logistic regression, random forest, and gradient boosting.
result The algorithms predicted fault start and end times effectively.
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.
Understanding the adaptation process of plants to drought stress is essential in improving management practices, breeding strategies as well as engineering viable crops for a sustainable agriculture in the coming decades. Hyper-spectral imaging provides a particularly promising approach to gain such understanding since…
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…
Paper proposes a predictive maintenance system for solar plants using big data.
problem Fault prediction in photovoltaic plants to reduce downtime and maintenance costs.
method Data-driven approach with unsupervised clustering and Pattern Recognition Neural Network.
result Effective prediction of both generic and specific faults, up to 7 days in advance.
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.
PLIT identifies plant lncRNAs from RNA-seq data with high accuracy.
problem Inaccurate identification of lncRNAs in plant transcriptomic datasets.
method PLIT uses L1 regularization and iRF classification to select optimal features from sequence and codon-bias data.
result PLIT outperforms existing CPC tools in identifying lncRNAs in plant RNA-seq datasets.
This paper studies the problem of detecting the presence of a small dense community planted in a large Erdős-Rényi random graph G(N,q), where the edge probability within the community exceeds q by a constant factor. Assuming the hardness of the planted clique detection problem, we show that the computatio…
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.
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.
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.
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.
Gradient descent learns ReLUs in high dimensions with optimal sample complexity.
problem Learning Rectified Linear Units (ReLUs) in high-dimensional settings.
method Projected gradient descent initialized at zero, with inputs from Gaussian distribution and labels from planted weights.
result Projected gradient descent converges linearly to the planted model with optimal sample complexity.
Study optimizes nuclear power plant decommissioning risk management.
problem Optimizing risk management for decommissioning nuclear power plants.
method Numerical stochastic optimization approach linking risk aversion to an optimization problem.
result Optimal strategy involves de-risking similar to a concave strategy.
Ecological systems have a high level of complexity combined with stability and rich biodiversity. Recently, the analysis of their properties and evolution has been pushed forward on a basis of concept of mutualistic networks that provides a detailed understanding of their features being linked to a high nestedness of t…
Polynomial-time algorithm finds planted hypercube vectors in Gaussian mixtures.
problem Clustering d-dimensional Gaussian mixtures with unknown covariance.
method Lattice-based methods using Lenstra--Lenstra--Lovasz reduction.
result Achieves statistically-optimal sample complexity of d+1 samples.
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.
Study optimizes natural gas power plant valuation using Levy copulas and regime-switching models.
problem Optimizing the valuation and operation of natural gas-fired power plants under market fluctuations.
method Stochastic control problem, Levy regime-switching model, skewed Levy copulas, HJB equation, finite difference method.
result Numerical method provides optimal operating strategies and plant values based on market prices and 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.
Paper presents an unsupervised method to estimate GHI from PV power measurements.
problem Precise solar irradiance assessment for PV plants is expensive and limited by satellite resolution.
method Completely unsupervised method based on a physical model of PV plants.
result The method outperforms satellite-based services, especially at high temporal resolutions.
Megaprojects like nuclear plants often overrun budgets and timelines due to planning flaws.
problem Megaprojects, including nuclear plants, frequently exceed budgets and timelines.
method Standardization and project delivery chain standardization are key strategies.
result Small Modular Reactors (SMRs) may offer a solution to megaproject risks.
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 on detecting and recovering hidden dense cycles in random graphs.
problem Detecting and recovering hidden dense cycles in random graphs.
method Information-theoretic analysis of thresholds for detection and recovery.
result Characterization of information-theoretic thresholds for detection and recovery.
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.
AI monitors social distancing and masks at manufacturing plants.
problem Ensuring safety of workers during post-COVID production.
method Computer vision and AI techniques for social distancing and mask detection.
result Real-time alerts prevent violations of social distancing and mask-wearing.
A new method for multi-task learning infers task hierarchies from data.
problem Inferring predictive maps between multiple tasks in plant genetics.
method Task clustering for sparse linear regression models.
result Superior predictive models and genetic mapping from remote sensing data.
Deep learning identifies plant stresses accurately and quantitatively.
problem Manual inspection of plant stresses is subjective and time-consuming.
method Developed an explainable deep learning model using gradient-weighted class activation mapping.
result Model accurately identifies and quantifies diverse foliar stresses in soybeans and other species.