论文提出混合学习方法处理分类未观测混杂因子的因果推断
一项最新研究提出利用混合学习技术解决因果推断中分类未观测混杂因子的问题。该论文由Aytijhya Saha等作者完成,于2026年5月提交至arXiv预印本平台。研究聚焦于传统因果推断方法在面对未观测混杂变量时存在的偏差问题,通过引入混合学习框架,能够有效分离并处理分类形式的未观测混杂因子,从而提升因果效应估计的准确性。该方法在理论推导和实验验证上均表现出对复杂混杂结构的鲁棒性,为流行病学、社会科学等领域的因果分析提供了新工具。论文还公开了相关代码,便于研究者复现和扩展。 #因果推断 #混合学习 #未观测混杂因子 #统计方法 #机器学习 #arXiv #学术论文
一项最新研究提出利用混合学习技术解决因果推断中分类未观测混杂因子的问题。该论文由Aytijhya Saha等作者完成,于2026年5月提交至arXiv预印本平台。研究聚焦于传统因果推断方法在面对未观测混杂变量时存在的偏差问题,通过引入混合学习框架,能够有效分离并处理分类形式的未观测混杂因子,从而提升因果效应估计的准确性。该方法在理论推导和实验验证上均表现出对复杂混杂结构的鲁棒性,为流行病学、社会科学等领域的因果分析提供了新工具。论文还公开了相关代码,便于研究者复现和扩展。 #因果推断 #混合学习 #未观测混杂因子 #统计方法 #机器学习 #arXiv #学术论文
统计力学视角下的高斯混合与非参数似然研究
一篇题为《统计力学视角下的高斯混合与非参数似然》的论文近日在arXiv预印本平台发布。该论文由Subhroshkhar Ghosh等四位作者联合撰写,旨在从统计力学的理论框架出发,重新审视高斯混合模型与非参数似然估计之间的关系。研究通过引入统计力学中的概念,如自由能和配分函数,为非参数似然问题提供了新的数学工具和解释。作者提出了一个统一的框架,将高斯混合的密度估计与最大似然估计的非参数形式联系起来,并探讨了该框架在数据稀疏或维度较高时的表现。这项研究不仅深化了对经典统计模型的理论理解,还为机器学习中的聚类、密度估计等任务提供了新的方法论基础,预计将对相关领域的研究产生积极影响。 #统计力学 #高斯混合模型 #非参数似然 #论文 #机器学习 #人工智能 #arXiv #数学 #统计学
一篇题为《统计力学视角下的高斯混合与非参数似然》的论文近日在arXiv预印本平台发布。该论文由Subhroshkhar Ghosh等四位作者联合撰写,旨在从统计力学的理论框架出发,重新审视高斯混合模型与非参数似然估计之间的关系。研究通过引入统计力学中的概念,如自由能和配分函数,为非参数似然问题提供了新的数学工具和解释。作者提出了一个统一的框架,将高斯混合的密度估计与最大似然估计的非参数形式联系起来,并探讨了该框架在数据稀疏或维度较高时的表现。这项研究不仅深化了对经典统计模型的理论理解,还为机器学习中的聚类、密度估计等任务提供了新的方法论基础,预计将对相关领域的研究产生积极影响。 #统计力学 #高斯混合模型 #非参数似然 #论文 #机器学习 #人工智能 #arXiv #数学 #统计学
高斯混合模型总变差与Hellinger距离间的尖锐不等式获证
在机器学习与概率论领域,高斯混合模型是一种广泛应用的概率分布表示。总变差距离与Hellinger距离是衡量两个分布差异的重要指标,但两者之间的精确关系此前缺乏严格刻画。近日,由Joonhyuk Jung和Chao Gao共同撰写的论文在2026年国际机器学习大会(ICML)上发表,系统推导了高斯混合模型下总变差与Hellinger距离之间的尖锐不等式。该研究给出了两者相互控制的显式界,填补了相关理论空白,有望为模型选择、密度估计和生成对抗网络等实际应用提供更精确的数学工具。 #机器学习 #ICML #高斯混合模型 #总变差 #Hellinger距离 #概率论 #不等式 #数学理论
在机器学习与概率论领域,高斯混合模型是一种广泛应用的概率分布表示。总变差距离与Hellinger距离是衡量两个分布差异的重要指标,但两者之间的精确关系此前缺乏严格刻画。近日,由Joonhyuk Jung和Chao Gao共同撰写的论文在2026年国际机器学习大会(ICML)上发表,系统推导了高斯混合模型下总变差与Hellinger距离之间的尖锐不等式。该研究给出了两者相互控制的显式界,填补了相关理论空白,有望为模型选择、密度估计和生成对抗网络等实际应用提供更精确的数学工具。 #机器学习 #ICML #高斯混合模型 #总变差 #Hellinger距离 #概率论 #不等式 #数学理论
网络动力学框架助力理解深度神经网络
一项最新研究提出了基于网络动力学的框架,用于深入理解深度神经网络的工作机制。该论文由Yuchen Lin等四位作者合作完成,即将发表于《中国科学:物理学 力学 天文学》(Sci. China Phys. Mech. Astron.)第69卷,文章编号270511(2026年)。论文自2025年1月起在arXiv预印本平台提交,历经多个版本修订,最终版本于2026年7月上传。该研究为解释深度神经网络的复杂行为提供了新的理论视角,有望推动人工智能基础理论的发展。 #网络动力学 #深度神经网络 #AI基础研究 #arXiv #中国科学 #物理学 #力学 #天文学 #神经网络解释
一项最新研究提出了基于网络动力学的框架,用于深入理解深度神经网络的工作机制。该论文由Yuchen Lin等四位作者合作完成,即将发表于《中国科学:物理学 力学 天文学》(Sci. China Phys. Mech. Astron.)第69卷,文章编号270511(2026年)。论文自2025年1月起在arXiv预印本平台提交,历经多个版本修订,最终版本于2026年7月上传。该研究为解释深度神经网络的复杂行为提供了新的理论视角,有望推动人工智能基础理论的发展。 #网络动力学 #深度神经网络 #AI基础研究 #arXiv #中国科学 #物理学 #力学 #天文学 #神经网络解释
Approximate full conformal prediction in an RKHS
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Davidson Lova Razafindrakoto [ view email ] [v1] Mon, 19 Jan 2026 14:40:49 UTC (639 KB) [v2] Sat, 24 Jan 2026 13:51:10 UTC (689 KB) [v3] Wed, 8 Jul 2026 08:19:49 UTC (689 KB) Full-text links: Access Paper: View a PDF of the paper titled Approximate full conformal prediction in an RKHS, by Davidson Lova Razafindrakoto and 1 other authors View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2026-01 Change to browse by: cs math stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Davidson Lova Razafindrakoto [ view email ] [v1] Mon, 19 Jan 2026 14:40:49 UTC (639 KB) [v2] Sat, 24 Jan 2026 13:51:10 UTC (689 KB) [v3] Wed, 8 Jul 2026 08:19:49 UTC (689 KB) Full-text links: Access Paper: View a PDF of the paper titled Approximate full conformal prediction in an RKHS, by Davidson Lova Razafindrakoto and 1 other authors View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2026-01 Change to browse by: cs math stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer
( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle ( What is ? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs 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 .
Diffusion Models in Simulation-Based Inference
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Jonas Arruda [ view email ] [v1] Mon, 22 Dec 2025 15:10:35 UTC (8,821 KB) [v2] Thu, 29 Jan 2026 14:33:29 UTC (8,870 KB) [v3] Wed, 8 Jul 2026 15:20:55 UTC (9,510 KB) Full-text links: Access Paper: View a PDF of the paper titled Diffusion Models in Simulation-Based Inference: A Tutorial Review, by Jonas Arruda and Niels Bracher and Ullrich K\"othe and Jan Hasenauer and Stefan T. Radev View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2025-12 Change to browse by: cs stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliog
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Jonas Arruda [ view email ] [v1] Mon, 22 Dec 2025 15:10:35 UTC (8,821 KB) [v2] Thu, 29 Jan 2026 14:33:29 UTC (8,870 KB) [v3] Wed, 8 Jul 2026 15:20:55 UTC (9,510 KB) Full-text links: Access Paper: View a PDF of the paper titled Diffusion Models in Simulation-Based Inference: A Tutorial Review, by Jonas Arruda and Niels Bracher and Ullrich K\"othe and Jan Hasenauer and Stefan T. Radev View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2025-12 Change to browse by: cs stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliog
raphic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle ( What is ? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs 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 .
Fast segmentation of watermarked texts from large language models through an epidemic change
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Subhrajyoty Roy [ view email ] [v1] Thu, 25 Sep 2025 13:44:34 UTC (768 KB) [v2] Wed, 8 Jul 2026 16:16:06 UTC (2,347 KB) Full-text links: Access Paper: View a PDF of the paper titled Fast segmentation of watermarked texts from large language models through an epidemic change-point framework, by Soham Bonnerjee and 1 other authors View PDF TeX Source view license Current browse context: < prev | next > new | recent | 2025-09 Change to browse by: cs stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliograph
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Subhrajyoty Roy [ view email ] [v1] Thu, 25 Sep 2025 13:44:34 UTC (768 KB) [v2] Wed, 8 Jul 2026 16:16:06 UTC (2,347 KB) Full-text links: Access Paper: View a PDF of the paper titled Fast segmentation of watermarked texts from large language models through an epidemic change-point framework, by Soham Bonnerjee and 1 other authors View PDF TeX Source view license Current browse context: < prev | next > new | recent | 2025-09 Change to browse by: cs stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliograph
ic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle ( What is ? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs 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 .
Optimal Conformal Prediction under Epistemic Uncertainty
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Alireza Javanmardi [ view email ] [v1] Sun, 25 May 2025 08:32:44 UTC (110 KB) [v2] Wed, 8 Jul 2026 13:19:58 UTC (328 KB) Full-text links: Access Paper: View a PDF of the paper titled Optimal Conformal Prediction under Epistemic Uncertainty, by Alireza Javanmardi and 5 other authors View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2025-05 Change to browse by: cs stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Co
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Alireza Javanmardi [ view email ] [v1] Sun, 25 May 2025 08:32:44 UTC (110 KB) [v2] Wed, 8 Jul 2026 13:19:58 UTC (328 KB) Full-text links: Access Paper: View a PDF of the paper titled Optimal Conformal Prediction under Epistemic Uncertainty, by Alireza Javanmardi and 5 other authors View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2025-05 Change to browse by: cs stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Co
nnected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle ( What is ? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs 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 .
Fixed-Gaussian Spectral Algorithms: Minimax Optimal Rates for Misspecified Learning and Transfer
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Haotian Lin [ view email ] [v1] Sat, 18 Jan 2025 20:33:37 UTC (234 KB) [v2] Tue, 7 Jul 2026 22:00:00 UTC (156 KB) Full-text links: Access Paper: View a PDF of the paper titled Fixed-Gaussian Spectral Algorithms: Minimax Optimal Rates for Misspecified Learning and Transfer, by Haotian Lin and 1 other authors View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2025-01 Change to browse by: cs stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliogra
Focus to learn more arXiv-issued DOI via DataCite Submission history From: Haotian Lin [ view email ] [v1] Sat, 18 Jan 2025 20:33:37 UTC (234 KB) [v2] Tue, 7 Jul 2026 22:00:00 UTC (156 KB) Full-text links: Access Paper: View a PDF of the paper titled Fixed-Gaussian Spectral Algorithms: Minimax Optimal Rates for Misspecified Learning and Transfer, by Haotian Lin and 1 other authors View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2025-01 Change to browse by: cs stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliogra
phic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle ( What is ? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs 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 .
Avoiding unsafe sets when training with Langevin Dynamics
Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Adam Oberman [ view email ] [v1] Wed, 8 Jul 2026 15:36:45 UTC (184 KB) Full-text links: Access Paper: View a PDF of the paper titled Avoiding unsafe sets when training with Langevin Dynamics, by Adam M. Oberman View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2026-07 Change to browse by: cs math stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers?
Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Adam Oberman [ view email ] [v1] Wed, 8 Jul 2026 15:36:45 UTC (184 KB) Full-text links: Access Paper: View a PDF of the paper titled Avoiding unsafe sets when training with Langevin Dynamics, by Adam M. Oberman View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2026-07 Change to browse by: cs math stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers?
) Litmaps Toggle Litmaps ( What is Litmaps? ) Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle ( What is ? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) IArxiv recommender toggle IArxiv Recommender ( What is IArxiv? ) Author Venue Institution Topic About arXivLabs 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 .
Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization
Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Adam Oberman [ view email ] [v1] Wed, 8 Jul 2026 15:11:21 UTC (76 KB) Full-text links: Access Paper: View a PDF of the paper titled Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization, by Adam M. Oberman View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2026-07 Change to browse by: cs math stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Tog
Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Adam Oberman [ view email ] [v1] Wed, 8 Jul 2026 15:11:21 UTC (76 KB) Full-text links: Access Paper: View a PDF of the paper titled Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization, by Adam M. Oberman View PDF HTML (experimental) TeX Source view license Current browse context: < prev | next > new | recent | 2026-07 Change to browse by: cs math stat References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Tog
gle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle ( What is ? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) IArxiv recommender toggle IArxiv Recommender ( What is IArxiv? ) Author Venue Institution Topic About arXivLabs 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 .