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.
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.
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.
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.
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…
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.
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…
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.
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…
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…
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…
Optimizes personalized medicine prediction by individual tuning.
problem Predicting individual drug responses using genomic information.
method Introduces a new ridge estimator and tuning parameter calibration scheme.
result Optimal in terms of oracle inequalities, fast, and highly effective.
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.
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.
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.
Fault detection in industrial plants is a hot research area as more and more sensor data are being collected throughout the industrial process. Automatic data-driven approaches are widely needed and seen as a promising area of investment. This paper proposes an effective machine learning algorithm to predict industrial…
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.
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.
We adopted an approach based on an LSTM neural network to monitor and detect faults in industrial multivariate time series data. To validate the approach we created a Modelica model of part of a real gasoil plant. By introducing hacks into the logic of the Modelica model, we were able to generate both the roots and cau…
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.
Plants sense their environment by producing electrical signals which in essence represent changes in underlying physiological processes. These electrical signals, when monitored, show both stochastic and deterministic dynamics. In this paper, we compute 11 statistical features from the raw non-stationary plant electric…
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.
Bandit algorithms optimize treatment decisions for precision medicine.
problem Optimizing treatment decisions for individual patients based on genetic or molecular profiling.
method Contextual bandit algorithms that consider patient characteristics.
result Bandit algorithms are useful for mobile health and digital phenotyping.
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.
This paper reviews random forest methods for analyzing longitudinal data in precision medicine.
problem Analyzing longitudinal data for precision medicine.
method Extensions of random forest for longitudinal data analysis.
result Categorization of random forest methods for different data structures and repeated measurements.
New method optimizes individualized decision rules for precision medicine.
problem Heterogeneous patient responses to treatments.
method Proposes a decision-rule based optimized covariates dependent equivalent (CDE) for individualized decision making.
result Numerical experiments show improved performance in estimating optimal IDRs.
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.
In this paper, we present a method to determine the global horizontal irradiance (GHI) from the power measurements of one or more PV systems, located in the same neighborhood. The method is completely unsupervised and is based on a physical model of a PV plant. The precise assessment of solar irradiance is pivotal for …
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.
We consider two problems that arise in machine learning applications: the problem of recovering a planted sparse vector in a random linear subspace and the problem of decomposing a random low-rank overcomplete 3-tensor. For both problems, the best known guarantees are based on the sum-of-squares method. We develop new …
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.
We describe a natural way to plant cherry- and plumtrees at prescribed generic locations in an orchard.
This paper considers the use of Machine Learning (ML) in medicine by focusing on the main problem that this computational approach has been aimed at solving or at least minimizing: uncertainty. To this aim, we point out how uncertainty is so ingrained in medicine that it biases also the representation of clinical pheno…
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.
Sublinear algorithms detect cliques in graphs with high probability.
problem Detecting a planted clique in random graphs efficiently.
method Non-adaptive low-degree polynomial queries of adjacency matrix entries.
result Sublinear time detection is possible for a specific range of clique sizes.
Is it possible to find the sparsest vector (direction) in a generic subspace S⊆Rp with dim(S)=n<p? This problem can be considered a homogeneous variant of the sparse recovery problem, and finds connections to sparse dictionary learning, sparse PCA, and many other …