Tootfinder

Opt-in global Mastodon full text search. Join the index!

@memeorandum@universeodon.com
2026-02-17 04:20:43

Cooper's Final Minutes (Oliver Darcy/Status)
status.news/p/anderson-cooper-
memeorandum.com/260216/p90#a26

@memeorandum@universeodon.com
2026-01-09 14:10:49

The Shadow Over '60' ... Earlier this week, on Tuesday, members of the "60 Minutes" ... (Oliver Darcy/Status)
status.news/p/60-minutes-bari-
memeorandum.com/260109/p29#a26

@memeorandum@universeodon.com
2026-01-07 16:55:40

The Dokoupil Debacle ... On Tuesday evening, newly installed "CBS Evening News" ... (Oliver Darcy/Status)
status.news/p/tony-dokoupil-cb
memeorandum.com/260107/p54#a26

@lilmikesf@c.im
2025-12-10 17:19:03

#MostWanted
#FBI seek #OrangeCounty #RealityTV producer that fled #USA

Oliver Darcy say - You've gotta read this...

This is one of those stories that just makes you click: "The former head of a California company that produced true crime TV shows has been added to the FBI's Most Wanted list, years after being
charged with portraying herself as an heiress to get millions of
dollars from lenders." 

The AP has details
$30 Million Dollar Fraud
@arXiv_csLG_bot@mastoxiv.page
2025-12-22 10:34:50

Regularized Random Fourier Features and Finite Element Reconstruction for Operator Learning in Sobolev Space
Xinyue Yu, Hayden Schaeffer
arxiv.org/abs/2512.17884 arxiv.org/pdf/2512.17884 arxiv.org/html/2512.17884
arXiv:2512.17884v1 Announce Type: new
Abstract: Operator learning is a data-driven approximation of mappings between infinite-dimensional function spaces, such as the solution operators of partial differential equations. Kernel-based operator learning can offer accurate, theoretically justified approximations that require less training than standard methods. However, they can become computationally prohibitive for large training sets and can be sensitive to noise. We propose a regularized random Fourier feature (RRFF) approach, coupled with a finite element reconstruction map (RRFF-FEM), for learning operators from noisy data. The method uses random features drawn from multivariate Student's $t$ distributions, together with frequency-weighted Tikhonov regularization that suppresses high-frequency noise. We establish high-probability bounds on the extreme singular values of the associated random feature matrix and show that when the number of features $N$ scales like $m \log m$ with the number of training samples $m$, the system is well-conditioned, which yields estimation and generalization guarantees. Detailed numerical experiments on benchmark PDE problems, including advection, Burgers', Darcy flow, Helmholtz, Navier-Stokes, and structural mechanics, demonstrate that RRFF and RRFF-FEM are robust to noise and achieve improved performance with reduced training time compared to the unregularized random feature model, while maintaining competitive accuracy relative to kernel and neural operator tests.
toXiv_bot_toot