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

Trend · papers per month

1122 · Sep 201919922001200920172026
36 results for potato breeding

Study uses machine learning to predict potato clones suitable for processing.

problem Efficiently identifying high-yield, disease-resistant potato varieties.
method Leveraged machine learning algorithms on Russet potato clones data from Oregon.
result Non-linear models like SVM and HGBC outperform traditional linear models in agricultural trials.

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.

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.

Interpretation of a machine learning induced models is critical for feature engineering, debugging, and, arguably, compliance. Yet, best of breed machine learning models tend to be very complex. This paper presents a method for model interpretation which has the main benefit that the simple interpretations it provides …

2018-02-26abs ↗pdf ↗

We consider a Nash equilibrium between two high-frequency traders in a simple market impact model with transient price impact and additional quadratic transaction costs. Extending a result by Schöneborn (2008), we prove existence and uniqueness of the Nash equilibrium and show that for small transaction costs the high-…

2013-05-17abs ↗pdf ↗

Authors construct symplectic Lefschetz pencils on complex projective plane.

problem Construct symplectic Lefschetz pencils on complex projective plane.
method Differential topological construction, analogous to holomorphic pencils.
result Explicit monodromy factorization and topological construction for d=4d=4.

There is a growing interest in learning data representations that work well for many different types of problems and data. In this paper, we look in particular at the task of learning a single visual representation that can be successfully utilized in the analysis of very different types of images, from dog breeds to s…

2017-05-22abs ↗pdf ↗

Reweighting training data to better represent new tasks.

problem Deploying machine learning models to new tasks is challenging due to training data distribution.
method Formulate an exponential tilt distribution shift model and learn train data importance weights to minimize KL divergence.
result The learned train data weights improve target performance evaluation, fine-tuning, and model selection.

Rewards are sparse in the real world and most of today's reinforcement learning algorithms struggle with such sparsity. One solution to this problem is to allow the agent to create rewards for itself - thus making rewards dense and more suitable for learning. In particular, inspired by curious behaviour in animals, obs…

2018-10-04abs ↗pdf ↗

In dialogues, an utterance is a chain of consecutive sentences produced by one speaker which ranges from a short sentence to a thousand-word post. When studying dialogues at the utterance level, it is not uncommon that an utterance would serve multiple functions. For instance, "Thank you. It works great." expresses bot…

2019-09-02abs ↗pdf ↗

A grand challenge in machine learning is the development of computational algorithms that match or outperform humans in perceptual inference tasks that are complicated by nuisance variation. For instance, visual object recognition involves the unknown object position, orientation, and scale in object recognition while …

2015-04-02abs ↗pdf ↗

Combining self-training and contrastive learning improves performance under distribution shift.

problem Improving performance under distribution shift using unlabeled data.
method Combining self-training and contrastive learning techniques.
result Combined method achieves 3-8% higher accuracy than either approach independently.

Prior work finds a diversity paradox: diversity breeds innovation, and yet, underrepresented groups that diversify organizations have less successful careers within them. Does the diversity paradox hold for scientists as well? We study this by utilizing a near-population of ~1.2 million US doctoral recipients from 1977…

2019-09-04abs ↗pdf ↗

Formalizes concepts as latent variables in hierarchical models for high-dimensional data.

problem Lack of formalization and theoretical insights for learning discrete concepts from high-dimensional data.
method Formalizes concepts as latent causal variables in a hierarchical model, formulates conditions for concept identification.
result Conditions for identifying latent hierarchical models in unsupervised data, handling complex structures and high-dimensional data.

DeepInversion generates images from trained networks without additional data.

problem Generating images from trained networks without real data.
method Inverting a trained network to synthesize images from random noise, optimizing using batch normalization layers and maximizing Jensen-Shannon divergence.
result Synthesized images from CIFAR-10 and ImageNet datasets show high fidelity and realism.

Study compares machine learning and process-based models for predicting rice blast disease.

problem Predicting rice blast disease to support rice growers in controlling the disease.
method Compared four models: two process-based (Yoshino and WARM) and two machine learning (M5Rules and RNN).
result Machine learning models outperformed process-based models in predicting rice blast disease.

ATC predicts target domain accuracy using only labeled and unlabeled data.

problem Predicting out-of-distribution performance with limited labeled data.
method Average Thresholded Confidence (ATC) method that learns a threshold on model confidence.
result ATC outperforms previous methods across various types of distribution shifts and datasets.