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 > math > arXiv:2506.23344

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2506.23344 (math)
[Submitted on 29 Jun 2025 ]

Title: Data-Driven Self-Supervised Learning for the Discovery of Solution Singularity for Partial Differential Equations

Title: 数据驱动的自监督学习用于偏微分方程解奇点的发现

Authors:Difeng Cai, Paulina Sepúlveda
Abstract: The appearance of singularities in the function of interest constitutes a fundamental challenge in scientific computing. It can significantly undermine the effectiveness of numerical schemes for function approximation, numerical integration, and the solution of partial differential equations (PDEs), etc. The problem becomes more sophisticated if the location of the singularity is unknown, which is often encountered in solving PDEs. Detecting the singularity is therefore critical for developing efficient adaptive methods to reduce computational costs in various applications. In this paper, we consider singularity detection in a purely data-driven setting. Namely, the input only contains given data, such as the vertex set from a mesh. To overcome the limitation of the raw unlabeled data, we propose a self-supervised learning (SSL) framework for estimating the location of the singularity. A key component is a filtering procedure as the pretext task in SSL, where two filtering methods are presented, based on $k$ nearest neighbors and kernel density estimation, respectively. We provide numerical examples to illustrate the potential pathological or inaccurate results due to the use of raw data without filtering. Various experiments are presented to demonstrate the ability of the proposed approach to deal with input perturbation, label corruption, and different kinds of singularities such interior circle, boundary layer, concentric semicircles, etc.
Abstract: 在感兴趣的函数中出现奇点构成了科学计算中的一个基本挑战。 它可能会显著削弱函数逼近、数值积分和偏微分方程(PDEs)求解等数值方案的有效性。 如果奇点的位置未知,问题会变得更加复杂,这在求解PDEs时经常遇到。 因此,检测奇点对于开发高效的自适应方法以减少各种应用中的计算成本至关重要。 在本文中,我们考虑在一个纯粹的数据驱动设置中的奇点检测。 即,输入仅包含给定的数据,例如来自网格的顶点集。 为了克服原始未标记数据的局限性,我们提出了一种自监督学习(SSL)框架来估计奇点的位置。 一个关键组成部分是作为SSL中预训练任务的过滤过程,其中提出了两种基于$k$最近邻和核密度估计的过滤方法。 我们提供了数值例子来说明在没有过滤的情况下使用原始数据可能导致的病态或不准确的结果。 进行了各种实验,以展示所提出方法处理输入扰动、标签损坏以及不同类型奇点(如内部圆、边界层、同心半圆等)的能力。
Subjects: Numerical Analysis (math.NA) ; Machine Learning (cs.LG); Machine Learning (stat.ML)
Cite as: arXiv:2506.23344 [math.NA]
  (or arXiv:2506.23344v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2506.23344
arXiv-issued DOI via DataCite

Submission history

From: Difeng Cai [view email]
[v1] Sun, 29 Jun 2025 17:39:41 UTC (3,231 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs
cs.LG
cs.NA
math
stat
stat.ML

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号