Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > q-bio > arXiv:2107.10901

Help | Advanced Search

Quantitative Biology > Genomics

arXiv:2107.10901 (q-bio)
[Submitted on 22 Jul 2021 ]

Title: A reinforcement learning approach to resource allocation in genomic selection

Title: 基于强化学习的基因组选择中的资源分配方法

Authors:Saba Moeinizade, Guiping Hu, Lizhi Wang
Abstract: Genomic selection (GS) is a technique that plant breeders use to select individuals to mate and produce new generations of species. Allocation of resources is a key factor in GS. At each selection cycle, breeders are facing the choice of budget allocation to make crosses and produce the next generation of breeding parents. Inspired by recent advances in reinforcement learning for AI problems, we develop a reinforcement learning-based algorithm to automatically learn to allocate limited resources across different generations of breeding. We mathematically formulate the problem in the framework of Markov Decision Process (MDP) by defining state and action spaces. To avoid the explosion of the state space, an integer linear program is proposed that quantifies the trade-off between resources and time. Finally, we propose a value function approximation method to estimate the action-value function and then develop a greedy policy improvement technique to find the optimal resources. We demonstrate the effectiveness of the proposed method in enhancing genetic gain using a case study with realistic data.
Abstract: 基因组选择(GS)是一种植物育种者用来选择个体进行交配并产生新物种世代的技术。 资源分配是GS中的关键因素。 在每次选择周期中,育种者面临着如何分配预算以进行杂交并产生下一代育种亲本的选择。 受最近人工智能问题强化学习进展的启发,我们开发了一种基于强化学习的算法,以自动学习在不同世代之间分配有限资源。 我们通过定义状态空间和动作空间,在马尔可夫决策过程(MDP)的框架下对问题进行了数学公式化。 为了避免状态空间的爆炸,提出了一种整数线性规划方法,该方法量化了资源与时间之间的权衡。 最后,我们提出了一种价值函数近似方法来估计动作价值函数,然后开发了一种贪心策略改进技术以找到最优资源分配。 我们通过一个使用现实数据的案例研究,展示了所提出方法在提高遗传增益方面的有效性。
Comments: 18 pages,5 figures
Subjects: Genomics (q-bio.GN) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Optimization and Control (math.OC)
Cite as: arXiv:2107.10901 [q-bio.GN]
  (or arXiv:2107.10901v1 [q-bio.GN] for this version)
  https://doi.org/10.48550/arXiv.2107.10901
arXiv-issued DOI via DataCite

Submission history

From: Saba Moeinizade [view email]
[v1] Thu, 22 Jul 2021 19:55:16 UTC (152 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
q-bio.GN
< prev   |   next >
new | recent | 2021-07
Change to browse by:
cs
cs.AI
cs.LG
math
math.OC
q-bio

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号