Home Knowledge Base c_\pi$

c_\pi$

No mentions found

This entity hasn't been tracked yet, or Iris is still building its knowledge base.

Related Articles from SNS

The Security Budget of Code LLMs: An Information-Theoretic Capacity-Security Bound

Announce Type: new Abstract: AI programming assistants make natural-language prompts a software-development interface, so small prompt perturbations become usability and security risks. We study an information-theoretic trade-off for code LLMs between functional capacity, $\Cap=\rmI(c^*;c_\pi)$, and perturbation retention, $\Sec=\rmI(c_\pi;\tilde c_\pi)$. Here $\Sec$ is a retention-channel quantity, not a direct measure of exploit success or vulnerable-code generation. For code completion...

arXiv CS 7d ago

The Security Budget of Code LLMs: An Information-Theoretic Capacity-Security Bound

arXiv:2606.03308v2 Announce Type: replace Abstract: AI programming assistants make natural-language prompts a software-development interface, so small prompt perturbations become usability and security risks. We study an information-theoretic trade-off for code LLMs between functional capacity, $\Cap=\rmI(c^*;c_\pi)$, and perturbation retention, $\Sec=\rmI(c_\pi;\tilde c_\pi)$. Here $\Sec$ is a retention-channel quantity, not a direct measure of exploit success or vulnerable-code generation....

arXiv CS 6d ago

A Unified Framework for Locality in Scalable MARL

arXiv:2602.16966v2 Announce Type: replace Abstract: Scalable methods for networked multi-agent reinforcement learning let each agent plan using only a small neighborhood of the agent graph. This works only when the system is value-local, meaning a perturbation at one agent affects the long-run value at another agent weakly when the two are far apart. In the average-reward setting, the standard way to certify locality is the Dobrushin row-sum bound on a single matrix $C^\pi$ that captures how...

arXiv CS 6d ago

Linear Cosine Palettes(2025)

Kind of a generative art thing, but mostly an attempt by the author to prove to herself that a she can write a short blog post without turning it into a goddamn monograph So. Looking back at my history on this blog I have noticed that I, ummmmmm, tend to write long posts. It is a character flaw of which I am acutely aware.

Hacker News 5d ago

Light-induced quantum friction of carbon nanotubes in water

Abstract Friction slows down moving objects at both macroscopic and microscopic scales1. At the electronic level, quantum friction describes direct transfer of momentum between a liquid and the electrons of a solid2. Owing to its microscopic nature, this phenomenon remains experimentally challenging to capture3.

Nature 20h ago

How Deep Are Deep GPs, Really? A Sharp Threshold and a Non-Gaussian Limit for Compositional GPs

arXiv:2606.08218v1 Announce Type: new Abstract: Compositional priors describe the generic properties of layered functions in deep Bayesian models, where deep neural networks with random weights are a canonical example. In the wide-network limit, the prior is a Gaussian process with a depth-dependent kernel, and its behaviour as depth grows has been extensively studied through this kernel. Here, we study another case, where each layer itself is a vector valued Gaussian process, and our aim is...

arXiv CS 1d ago

Synthesis of single-layered fluorographdiyne nanosheets via selective on-surface 2D covalent polymerization

Announce Type: cross Abstract: Two-dimensional conjugated polymers (2DCPs) are significant macromolecular materials with intriguing and tunable physicochemical properties that depend on their geometries. Graphdiyne and its derivatives are exemplary 2DCPs featuring sp-sp2 hybridized skeletons. However, achieving single-layered, large-domain/regular graphdiyne and its derivatives on surfaces remains a formidable challenge due to the lack of selective 2D covalent polymerization methods.

arXiv Physics 8d ago

Local and Global Contraction Principles for MCMC Mixing

arXiv:2606.03033v1 Announce Type: new Abstract: We develop a contraction-based framework for proving mixing-time bounds for Markov chain Monte Carlo algorithms. The framework is built around global and local contraction coefficients of Markov kernels under the $\mathsf E_\gamma$-divergence with $\gamma\ge1$. For projected Langevin Monte Carlo on a compact convex domain, we show that Gaussian smoothing yields an explicit global contraction coefficient for the $\mathsf E_\gamma$-divergence....

arXiv CS 7d ago

Flipper One wants to be the Linux multi-tool in your pocket

Flipper Devices has unveiled the Flipper One, an ARM-based Linux computer designed as a versatile multi-tool, featuring extensive connectivity like HDMI and Gigabit Ethernet. Unlike the Flipper Zero, the One is a full Linux computer with 8GB of RAM and 64GB of storage, priced around $350 for the base model. The company aims for full mainline Linux kernel support to ensure broad compatibility and flexibility for users.

The Register 20d ago

I tested every IP KVM in my Homelab

I tested every IP KVM in my Homelab Since the PiKVM came out in 2017, there's been an explosion of IP KVMs. I've tested almost every one. But what are they good for?

Hacker News 5d ago