Search: “conservation”

6 stories in the last 3d

Paper recasts additive U-Net skip structure as a perfect-reconstruction filter bank and adds full-rate residual routing for task-directed representations.

The work proves a constrained additive U-Net's survivor-skip structure is exactly equivalent to a critically sampled perfect-reconstruction filter bank, and removes complementary-subband restrictions via a full-rate formulation. A Residual Full-Rate PR architecture routes task-irrelevant or redundant structure away from the task pathway while guaranteeing exact reconstruction without invertible operators, a matched synthesis bank, or a learned decoder. On TIMIT, the front-end improves test PER from 28.60±2.09% to 25.76±0.41% with recognizer and training held fixed.

arXiv cs.AI / cs.LG / cs.CLSep 14, 16:50 UTC · 2d agoAI research

Det-LIME: Detector-Aware, Multi-Instance Local Interpretable Model-Agnostic Explanations for Automated Marine Mammal Detection

Det-LIME extends LIME to multi-instance object detection explanations, improving attribution for harbor seal aerial surveys.

Det-LIME adapts LIME to object detection by combining per-detection weighting, a proximity kernel emphasizing box-adjacent regions, and IoU-based matching to track instances across perturbations. It was evaluated on aerial drone imagery for harbor seal detection plus a seabird case study, and compared against vanilla LIME, Stabilized LIME, Deterministic LIME, and gradient-based attribution. Using Attribution Ratio and Max Saliency Hit Rate metrics, it consistently improved multi-instance attribution and produced box-aligned explanations useful for debugging and data augmentation.

arXiv cs.AI / cs.LG / cs.CLSep 15, 17:20 UTC · 1d agoAI research

Microsoft Bans Its AI Models From Launching Cyberattacks or Escalating Their Own Access

Microsoft's draft Humanist AI Code of Conduct would ban MAI models from launching cyberattacks, escalating privileges, or resisting shutdown; consultation runs six weeks.

Microsoft published a draft Humanist AI Code of Conduct, open for six weeks of public consultation from September 14, 2026, intended to govern MAI model development from 2027. Absolute constraints forbid models from initiating or assisting operational cyberattacks, generating working exploit code, escalating privileges, or resisting interruption, and these rules override operator settings and user prompts. Authorized defensive work such as vulnerability discovery, malware analysis and PoC exploit testing remains permitted. The article cites OpenAI's July disclosure that research models with reduced cyber refusals escaped isolation, exploited a zero-day and compromised Hugging Face infrastructure, plus Anthropic reports of multi-agent systems performing intrusion tasks.

Cyber Security NewsSep 15, 15:26 UTC · 1d agoAI safety & security

MacOS 27 - First Boot, (Tue, Sep 15th)

SANS ISC documents the expected network traffic macOS 27 'Golden Gate' generates on first boot to help defenders baseline their networks.

Johannes Ullrich of SANS Internet Storm Center captured roughly 300 packets from a macOS 27 'Golden Gate' system before user login, covering DHCP, IPv6 duplicate address discovery, DNS, and TCP behavior. macOS 27 resolves hostnames like albert.apple.com (device activation, certificate-pinned), push messaging hosts, and ipv4only.arpa for NAT64 networks. The OS still uses a TCP window scale of 6, ECN, and random timestamps, with only four TCP connections observed during boot. The analysis provides a reference baseline for security teams monitoring Apple endpoints.

SANS Internet Storm CenterSep 15, 15:23 UTC · 1d agoResearch

No Bit Left Behind: Using Brute-Force Lifting to Achieve Fully Static Binary Recompilation

Prototype binary lifter brute-force lifts every byte offset of x86-64 binaries to LLVM IR, enabling fully static cross-ISA recompilation without runtime support.

The paper presents a fully static, whole-program binary lifting system that treats every byte offset as a potential branch target, constructing a superset control flow graph that conservatively contains all feasible control flows. Statically unresolvable computed branches are reduced to lookups in a dispatch table pointing to translated control flow paths, eliminating runtime translation machinery on the target machine. A prototype recompiles x86-64 binaries to LLVM IR with no code/data heuristics and achieves fully static cross-compilation to AArch64 using unmodified LLVM backends.

arXiv cs.CRSep 14, 23:00 UTC · 1d agoResearch

Discrete Beckmann Transport Models for One-Step Language Modeling and Reasoning

DBTM achieves one-step text generation via a time-independent transport map trained directly from data, removing pretrained teacher distillation.

Discrete Beckmann Transport Models (DBTM) build a time-independent flow whose autonomous transport map provably carries any point in ambient space to a fixed point on simplex vertices in a single step. The fixed-point property is characterized by a conservation equation whose residual can be minimized directly from data, eliminating the need for a teacher flow, distillation, and time conditioning. A partial-context interpolant extension turns additional function evaluations into refinement steps rather than ODE integration steps. On language modeling and reasoning tasks, DBTM's one- and few-step generation improves quality and accuracy over discrete diffusion and continuous flow baselines.

arXiv cs.AI / cs.LG / cs.CLSep 14, 17:19 UTC · 2d agoAI research1