After undergoing the ritual debate of Coopers Hawk or Sharp Shinned Hawk, we’ve unanimously decided this is a Coopers Hawk that swooped down in pursuit of a small bird hiding in a holly bush.
After playing it cool in this nearby tree, the hawk tried diving into the bush (ouch!), landing & coming up from underneath, but could not reach nor flush out its prey.
It then landed on the railing & became aware of us gaping at it from our front window. Rightfully spooked, it flew …
@carlos@perceptiveconstructs.com
@carlos@social.perceptiveconstructs.comMy talk at @… got accepted.
https://26.foss-backstage.de/session/disobey-foss-tools-to-fight-back-and-their-a…
SEO question, I apologise:
Whilst it is best practice for the link set in a <link rel='canonical' tag to point to a page that doesn't redirect, is there actually a “penalty” for doing such a redirect?
Falcons president Matt Ryan won't commit to Michael Penix Jr. as starting QB when healthy https://www.nfl.com/news/falcons-president-matt-ryan-wont-commit-michael-penix-jr-starting-qb
Learning-augmented smooth integer programs with PAC-learnable oracles
Hao-Yuan He, Ming Li
https://arxiv.org/abs/2602.02505 https://arxiv.org/pdf/2602.02505 https://arxiv.org/html/2602.02505
arXiv:2602.02505v1 Announce Type: new
Abstract: This paper investigates learning-augmented algorithms for smooth integer programs, covering canonical problems such as MAX-CUT and MAX-k-SAT. We introduce a framework that incorporates a predictive oracle to construct a linear surrogate of the objective, which is then solved via linear programming followed by a rounding procedure. Crucially, our framework ensures that the solution quality is both consistent and smooth against prediction errors. We demonstrate that this approach effectively extends tractable approximations from the classical dense regime to the near-dense regime. Furthermore, we go beyond the assumption of oracle existence by establishing its PAC-learnability. We prove that the induced algorithm class possesses a bounded pseudo-dimension, thereby ensuring that an oracle with near-optimal expected performance can be learned with polynomial samples.
toXiv_bot_toot
Number of misrepresented statements on Phoronix: 1
https://www.phoronix.com/news/RISC-V-Security-CPU-Not-So-Good
No. This is, first of all, not a matter of the ISA.
It is more of an implementation issue, for any ISA, FWIW.
See the citations!
Su…