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 > hep-ph > arXiv:2212.00046

Help | Advanced Search

High Energy Physics - Phenomenology

arXiv:2212.00046 (hep-ph)
[Submitted on 30 Nov 2022 ]

Title: Feature Selection with Distance Correlation

Title: 基于距离相关性的特征选择

Authors:Ranit Das, Gregor Kasieczka, David Shih
Abstract: Choosing which properties of the data to use as input to multivariate decision algorithms -- a.k.a. feature selection -- is an important step in solving any problem with machine learning. While there is a clear trend towards training sophisticated deep networks on large numbers of relatively unprocessed inputs (so-called automated feature engineering), for many tasks in physics, sets of theoretically well-motivated and well-understood features already exist. Working with such features can bring many benefits, including greater interpretability, reduced training and run time, and enhanced stability and robustness. We develop a new feature selection method based on Distance Correlation (DisCo), and demonstrate its effectiveness on the tasks of boosted top- and $W$-tagging. Using our method to select features from a set of over 7,000 energy flow polynomials, we show that we can match the performance of much deeper architectures, by using only ten features and two orders-of-magnitude fewer model parameters.
Abstract: 选择哪些数据属性作为多元决策算法的输入——即特征选择——是解决任何机器学习问题的重要步骤。虽然有越来越多的趋势是将复杂的深度网络训练在大量相对未处理的输入上(所谓的自动化特征工程),但在物理学的许多任务中,已经存在理论上有依据且理解充分的特征集。使用这些特征可以带来诸多好处,包括更高的可解释性、减少训练和运行时间,以及增强稳定性和鲁棒性。我们开发了一种基于距离相关性的新特征选择方法(DisCo),并在提升顶夸克和$W$-标签任务中展示了其有效性。通过从超过7,000个能量流多项式中选择特征,我们证明仅使用十个特征和少两个数量级的模型参数就可以达到更深层架构的性能。
Comments: 14 pages, 8 figures, 3 tables
Subjects: High Energy Physics - Phenomenology (hep-ph) ; Machine Learning (cs.LG); High Energy Physics - Experiment (hep-ex); Data Analysis, Statistics and Probability (physics.data-an)
Cite as: arXiv:2212.00046 [hep-ph]
  (or arXiv:2212.00046v1 [hep-ph] for this version)
  https://doi.org/10.48550/arXiv.2212.00046
arXiv-issued DOI via DataCite

Submission history

From: Ranit Das [view email]
[v1] Wed, 30 Nov 2022 19:00:04 UTC (1,774 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
hep-ph
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
cs.LG
hep-ex
physics
physics.data-an

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号