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 > stat > arXiv:2506.06542v1

Help | Advanced Search

Statistics > Machine Learning

arXiv:2506.06542v1 (stat)
[Submitted on 6 Jun 2025 ]

Title: Direct Fisher Score Estimation for Likelihood Maximization

Title: 直接Fisher分数估计用于最大化似然性

Authors:Sherman Khoo, Yakun Wang, Song Liu, Mark Beaumont
Abstract: We study the problem of likelihood maximization when the likelihood function is intractable but model simulations are readily available. We propose a sequential, gradient-based optimization method that directly models the Fisher score based on a local score matching technique which uses simulations from a localized region around each parameter iterate. By employing a linear parameterization to the surrogate score model, our technique admits a closed-form, least-squares solution. This approach yields a fast, flexible, and efficient approximation to the Fisher score, effectively smoothing the likelihood objective and mitigating the challenges posed by complex likelihood landscapes. We provide theoretical guarantees for our score estimator, including bounds on the bias introduced by the smoothing. Empirical results on a range of synthetic and real-world problems demonstrate the superior performance of our method compared to existing benchmarks.
Abstract: 我们研究了当似然函数无法解析但模型模拟易于获得时的似然最大化问题。 我们提出了一种顺序梯度优化方法,该方法基于局部分数匹配技术直接对Fisher得分建模,该技术使用在每个参数迭代点周围的局部区域内进行的模拟。 通过采用线性参数化来替代分数模型,我们的技术得到了一个闭式最小二乘解。 这种方法对Fisher得分提供了一个快速、灵活且高效的近似值,有效地平滑了似然目标函数,并缓解了复杂似然景观带来的挑战。 我们为分数估计器提供了理论保证,包括由平滑引入的偏差的界限。 在一系列合成和真实世界的问题上的实证结果显示,与现有基准相比,我们的方法表现更优。
Subjects: Machine Learning (stat.ML) ; Machine Learning (cs.LG)
Cite as: arXiv:2506.06542 [stat.ML]
  (or arXiv:2506.06542v1 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.2506.06542
arXiv-issued DOI via DataCite

Submission history

From: Sherman Khoo [view email]
[v1] Fri, 6 Jun 2025 21:19:14 UTC (167 KB)
Full-text links:

Access Paper:

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

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号