Search: “lower-bounds”

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

Minimax-Optimal Online Contract Design with Unrestricted Bounded Contracts

The paper proves minimax-optimal regret of order T^(m/(m+1)) for repeated online contract design with unrestricted bounded contracts and arbitrary agent action spaces.

The study analyzes repeated contract design where a principal observes outcomes but not agent actions, allowing arbitrary bounded outcome-contingent payment vectors. For any fixed number m of outcomes with m>=2, minimax regret over T rounds is of order T^(m/(m+1)) up to logarithmic factors, matched by upper and lower bounds. The upper bound uses an effective-dimension reduction and revealed preference in payment-difference coordinates, without smoothness or monotone-surplus assumptions, while the lower bound shows each additional contractible outcome increases worst-case learning cost.

arXiv cs.AI / cs.LG / cs.CL·Sep 17, 13:17 UTC · 1d agoAI research

20

Security Incident – BGP Hijacking

Attackers BGP-hijacked Softaculous' Hetzner IP block for 33 hours, obtained valid TLS certificates, and delivered a malicious Virtualizor update to some servers.

Between August 28 and 30, 2026, AS62390 (NexonHost) announced 162.55.80.0/24 via transit AS6204 (Zet.net) without authorization, diverting traffic while retaining Hetzner's AS24940 on the AS path. The attacker obtained valid Let's Encrypt certificates for virtualizor.com domains because the CA's domain validation was also routed through the hijack, so affected connections showed no TLS warnings. A malicious Virtualizor update package reached a handful of installations; routing was fully restored, and reconstruction from RIPE RIS data showed all 368 collector peers carried the hijacked route at some point with roughly 28% time-weighted diversion.

Lobsters · security·Sep 3, 02:07 UTC · 15d agoData breach

57

Silver Rate Is (Almost) Optimal for Gradient Descent Acceleration

New optimization theory paper proves near-optimal lower bounds for gradient descent with predetermined stepsizes, confirming silver-schedule optimality.

The paper studies the limits of accelerating gradient descent using predetermined nonnegative stepsizes in smooth convex optimization, with the key constant p_sil = log2(1 + sqrt(2)). It proves a non-anytime lower bound of Omega(n^(-p_sil - O(sqrt(log log n / log n)))) on the error achievable by any such stepsize schedule. In the anytime setting, it shows every infinite nonnegative schedule must incur error Omega(n^(-2*p_sil/(1+p_sil) - O(sqrt(log log n / log n)))) at infinitely many horizons. Combined with the silver-schedule upper bound of Altschuler and Parrilo (2025) and the anytime upper bound of Zhang et al. (2025), these results determine the optimal polynomial convergence exponents in both settings.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:59 UTC · 9d agoAI research

28

Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks

Theory paper derives nearly tight Rademacher complexity bounds for sparsely activated one-hidden-layer ReLU networks.

Building on Awasthi et al. (COLT 2024), the authors bound statistical complexity for networks where each input activates at most k of s hidden units. A support-preserving cover and normalized chaining argument remove the explicit dimension factor, with matching lower bounds up to logarithms. They also derive agnostic minimax excess-risk bounds of order min{1, sqrt(s/(km))} for a normalized bounded loss and show bias bounds comparable to WR restore worst-case rates even on domains where sparsity holds globally.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:53 UTC · 9d agoAI research

16

Hardcoded MCP credentials found in public GitHub files

Hush Security found 12% of 82,000 public GitHub MCP config files contained hardcoded API keys, bearer tokens, and database passwords.

Hush Security's 'The State of MCP Configuration: The Identity Security Gaps' report analyzed roughly 82,000 MCP configuration files in public GitHub repositories, finding that 12% of credential slots contained hardcoded credential literals. Researchers used provider-specific token patterns and Shannon entropy to identify likely secrets, predominantly vendor API keys, bearer tokens, and database passwords. Of 7,681 credential-bearing configurations whose history was examined, 243 had secrets removed from the current file but still recoverable from earlier Git commits. Many exposed credentials were high-impact: 53% of classified credentials granted organization-, account-, workspace-, or database-wide access, and 80% with a defined expiration policy did not expire by default.

Help Net Security·05:30 UTC · 8h agoResearch 2 sources

55

A Note on Sphere Packing Bounds for Tuple Lattice Sieving

Proves upper bounds on k-irreducible unit vector set rates, yielding nearly tight asymptotics relevant to tuple lattice sieving in cryptanalysis.

The paper bounds the maximal asymptotic rate of k-irreducible sets of unit vectors via spherical code packing bounds. It shows R_k is sandwiched between (1/2 - o(1)) log2(k)/k and (1 + o(1)) log2(k)/k for large k. These almost-tight bounds inform subexponential complexity analyses of tuple lattice sieving, which underpins security estimates for lattice-based cryptography.

arXiv cs.CR·Sep 8, 03:20 UTC · 10d agoResearch

15

Apple Reference Image: A New Approach for Verified Photography

Apple introduces Reference Image, hardware-backed verifiable photography on iPhone 18 Pro using sensor signing and Private Cloud Compute to counter AI-generated fakes.

Apple announced Reference Image, an opt-in camera mode debuting on the main sensor of iPhone 18 Pro and iPhone 18 Pro Max that produces securely timestamped, verifiable photographs. The design splits into two phases: a secure digital negative created by cryptographically signing pixel data at the sensor immediately after capture (preventing injection or tampering), then developing that negative into a reference image. Private Cloud Compute handles processing without exposing image contents to anyone, including Apple, and fraudulent reference images can be revoked without revealing the photographer's identity. Apple positions the system as stronger than C2PA-based approaches, which sign metadata after capture, are vulnerable to editing-chain compromise, and can tie images to a device or individual.

Hacker News · security·Sep 16, 02:07 UTC · 2d agoResearchHN 25↑ · 18 comments

65

Objective vs. Search: Decomposing What Makes a Good Tokeniser

New tokeniser study shows search procedure, not optimisation objective, drives bits-per-byte performance across model sizes, vocabulary sizes, and multilingual settings.

The paper disentangles BPE and UnigramLM along two axes: optimisation objective (compression vs log-likelihood) and search procedure (bottom-up merging vs top-down pruning). Two new algorithms, BottomUpLL and TopDownComp, complete the 2x2 design space, and trained language models are evaluated on bits-per-byte and BLiMP across model sizes, vocabulary sizes, and English-only vs multilingual domains. Bottom-up tokenisers consistently achieve lower bits-per-byte in most settings, while BLiMP shows no consistent relationship with design choice.

arXiv cs.AI / cs.LG / cs.CL·Sep 16, 17:59 UTC · 1d agoAI research

28

PIDS-Bench: Evaluating Prompt-Injection Detectors Under Over-Defense, Obfuscation, and Distribution Shift

PIDS-Bench shows prompt-injection detectors scoring F1 above 0.98 still misclassify about one-third of external benign security-adjacent prompts, revealing provenance-sensitive over-defense.

PIDS-Bench is a frozen multi-axis benchmark that jointly evaluates prompt-injection detectors on attack detection and benign false-positive behavior at fixed thresholds, spanning in-distribution inputs, hard-benign prompts, obfuscated attacks, and domain/structural distribution shifts. It evaluates seven detectors plus a rule-based lower-bound reference. A detector exceeding F1 = 0.98 on held-out data still misclassifies roughly one-third of an externally-sourced benign security-adjacent subset, and no internal detector reaches F1 >= 0.95 with hard-benign FPR <= 0.10 on the stress distribution. Hard-negative augmentation nearly eliminates over-defense on curated stress inputs but leaves it intact on externally-sourced prompts, a pattern termed provenance-sensitive over-defense.

arXiv cs.CR·Sep 14, 04:28 UTC · 4d agoAI safety & security

38

Differential Privacy Meets Fixed Parameter Tractability: Algorithms and Lower Bounds

Theory paper combines differential privacy with fixed-parameter tractable encoders, improving approximation guarantees for combinatorial optimization and proving new lower bounds.

The paper studies combinatorial optimization under epsilon-differential privacy within the implicit encoder-decoder framework of Gupta et al. (SODA 2010), generalizing it to allow fixed-parameter tractable encoders. This circumvents approximation barriers inherent to polynomial-time algorithms and yields improved guarantees for fundamental combinatorial optimization problems. The authors establish the first representation-independent lower bounds: assuming a non-uniform variant of the Gap Exponential Time Hypothesis, no epsilon-DP encoder-decoder pair can achieve certain approximation guarantees with a subexponential-time decoder for sufficiently small epsilon. Representation-dependent lower bounds are also provided for larger epsilon.

arXiv cs.CR·Sep 11, 07:13 UTC · 7d agoResearch1

18

The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements

Researchers derive sufficient sample-size conditions for recovering sparse binary signals from sparse Gaussian measurements, quantifying an information-theoretic threshold of order slog(p/s)/log(ds/p).

The paper studies support recovery of sparse binary signals from noisy linear measurements. For sparse Gaussian designs, the authors identify sufficient minimal sample sizes for maximum-likelihood recovery in the high-SNR regime d*s/p -> infinity, yielding an information-theoretic threshold of order slog(p/s)/log(ds/p) that makes the price of measurement sparsity explicit. They also show a regime where the sample-complexity loss from sparsity is only logarithmic while computational gains are nearly linear, and prove that for independently sparsified dense Gaussian designs a sample size of order p/ψ² suffices for support recovery at any fixed error level.

Hugging Face daily papers·Sep 7, 20:00 UTC · 10d agoAI research

12

Proximity Gaps for Gabidulin Codes and Applications

Researchers prove proximity-gap bounds for rank-metric and Gabidulin codes, enabling the first polynomial commitment scheme framework based on rank-metric error-correcting codes.

The paper proves every linear rank-metric code admits a proximity gap for deltas up to (d-1)/(3n) with error at most q^(e+1)/q^m, and improves the gap to (d-1)/(2n) for Gabidulin codes with error at most 10q^(n-1)/q^m, matching bounds for Reed-Solomon codes. A constructed infinite family of constant-rate Gabidulin codes shows the (d-1)/(2n) bound is tight, and a counterexample establishes a lower bound on the error at the d/(3n) gap. Applications include an IOPP for interleaved Gabidulin codes adapted from the Ligero IOPP and a q-linearized polynomial commitment scheme adapted from Ligero-based PCS, reportedly the first PCS framework based on rank-metric codes.

arXiv cs.CR·Sep 9, 07:45 UTC · 9d agoResearch

20

Characterizing Language Generation in the Limit: Finite Witnesses and a Separation-Width Hierarch

New work characterizes language generation in the limit via finite witnesses, proves a full separation-width hierarchy, and formalizes all results in Lean.

The paper fully characterizes when language generation in the limit is possible for arbitrary families over a countable universe: each target must admit a finite positive witness such that targets activated by any finite sample share an infinite common intersection. It defines positive separation width and proves every level of the resulting hierarchy occurs, with countable families admitting singleton witnesses and unions of families with infinite common cores requiring unbounded finite witnesses. The characterization, a universal normalization, and a diagonal capture lemma are machine-checked in the Lean proof assistant, with the development maintained on GitHub.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 17:54 UTC · 8d agoAI research1

18

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

Theoretical framework bounds generalization for gradient descent with weight decay, deriving conditions that explain delayed generalization and grokking.

The paper proves convergence of gradient descent with weight decay to a neighborhood of global minimizers of the empirical l2 loss for a broad class of neural networks. It decomposes population error into data, optimization, and prediction variation errors, deriving cellwise and layerwise approximate-homogeneity bounds on prediction variation along the training trajectory. The resulting necessary and sufficient conditions explain layerwise generalization differences and provide a theoretical characterization of grokking.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 16:59 UTC · 10d agoAI research

12

Breaking the 1.58-bit Barrier for Ternary LLMs

An arXiv paper claims a method that breaks the 1.58-bit barrier for ternary large language models.

The arXiv preprint 2609.16338, titled 'Breaking the 1.58-bit Barrier for Ternary LLMs,' presents research on ternary-weight large language models, which use roughly 1.58 bits per weight. The source text contained only the title and Hacker News engagement data (56 points, no comments), so further technical details are not available.

Hacker News · AI·Sep 16, 20:59 UTC · 1d agoAI researchHN 56↑ · 0 comments

35

Dependency-Aware ROM/CBD Correctness Bounds for ML-KEM-768 at the Heuristic Failure Scale

Researchers certify a dependency-preserving upper bound of 2^-164.81 on honest decapsulation failure for ML-KEM-768 within an explicit ROM/CBD abstraction.

The paper models ML-KEM-768's domain-separated public-matrix streams as independent uniform ring elements and secret polynomials as CBD2 primitives, explicitly not claiming an information-theoretic result about the fixed SHAKE instantiation in FIPS 203. It preserves dependencies from the public matrix and both ciphertext-compression terms, using a graph-coupled reference, a proper-ideal bivariate Fourier transport, and a 256-coordinate union bound. The certified bound is Pr[K' != K] <= 2^-164.81, with the exponent 164.8107162... exceeding the 164.81 threshold by only about 0.0007162 bits; 164.82 is not certified. The bound applies to messages fixed independently of the randomness under honest encryption and decapsulation, and is not an exact DFR, a fixed-SHAKE equivalence, or a new IND-CCA reduction.

arXiv cs.CR·Sep 9, 10:13 UTC · 9d agoResearch1

30

A positive resolution of the gap-entropy conjecture

New proof resolves the gap-entropy conjecture for Gaussian bandits, bounding optimal best-arm identification samples by H(log(1/delta)+Ent(I)) up to constants.

A paper proves the gap-entropy conjecture for fixed-confidence best-arm identification with independent unit-variance Gaussian arms, means in [0,1], and a unique optimal arm. It shows the optimal expected sample count, averaged over arm-label permutations, is within absolute constant factors of H(log(1/delta)+Ent(I)), where H sums squared gaps and Ent(I) is the instance's gap-entropy. It also gives an instance-independent algorithm bounded by a constant multiple of this quantity plus a g^-2 loglog(e^e/g) term for the smallest gap g.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 17:57 UTC · 8d agoAI research

15

Benign Loss Landscapes Can Coexist with Worst-Case Hardness

Theory paper shows tree tensor networks contain worst-case hard targets yet benign loss landscapes, with difficulty arising from degenerate saddles.

The paper studies tree tensor networks (TTNs), which generalize deep linear networks and Tucker decompositions and embed arbitrary read-once Boolean formulas. It proves that every local minimum that is minimum-norm is global for every realizable target, so bad local minima do not distinguish typical from worst-case problems. Instead, learning difficulty arises from high-order degenerate saddle points caused by rank-deficiency, illustrated via a parity function case study, linking landscape geometry to computational hardness.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:57 UTC · 6d agoAI research

16

Thin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold start

Thin-shell stability proof along the Gaussian cooling path improves cold-start logconcave sampling complexity to near n^2.5 from n^2.75.

The authors prove that logconcave probability measures along the Gaussian cooling path have thin-shell stability, generalizing the thin-shell theorem. This yields improved complexity for sampling an arbitrary logconcave distribution from a cold start. For (near-)isotropic logconcave distributions the complexity is nearly n^2.5, improving the previous n^2.75 bound and matching the abstract Speedy walk.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:10 UTC · 3d agoAI research

10

Quantile-based Loss Filtering for Outlier-Robust Stochastic Gradient Descent

Quantile-k-Loss SGD filters corrupted component losses by quantile sampling, proving linear convergence while outperforming standard and min-k-loss SGD.

The paper proposes Quantile-k-Loss SGD (Q(k)L-SGD), a loss-filtering framework for finite-sum optimization with corrupted components that samples k losses per iteration and updates using an index from the lower empirical q-quantile. The authors prove linear convergence under standard convexity, requiring sample size to scale with the number of corruptions, plus a complementary small-sample probabilistic analysis. Experiments on polynomial regression, regularized logistic regression, and hinge loss show intermediate quantiles often outperform both standard SGD and min-k-loss SGD.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:38 UTC · 6d agoAI research

18

General Quantification of Covariate and Concept Shifts

Paper proposes γ*-concept shifts via entropic optimal transport, deriving estimable generalization bounds unifying covariate and concept shift under distribution shift.

The authors show existing definitions of concept shift break when source and target supports mismatch and propose γ*-concept shifts grounded in entropic optimal transport. They derive a general error bound covering broad loss functions, label spaces and stochastic labeling, plus estimators with concentration guarantees. The resulting DataShifts algorithm quantifies distribution shifts and estimates the error bound in most applications, addressing learning bounds that were previously non-estimable from samples.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:57 UTC · 7d agoAI research1

28

Optimal Rates for Agentic Networked Information Aggregation

Researchers close the Kearns–Roth–Ryu gap for agentic networked information aggregation, proving excess error is constant up to depth M^2 then Θ(M^2/D).

The paper studies a networked learning model where agents in a DAG each see only a subset of features and pass only their predictions forward. It sharpens the earlier lower bound to Ω(√(M/D)) for depth below M^2 and constructs M-covered paths of depth D ≥ M^2 achieving Ω(M^2/D) excess error, establishing the correct rate for both regression and logistic classification. It also shows excess error contracts geometrically along the path for any fixed distribution, ruling out a single instance that witnesses polynomial lower bounds at every depth.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 16:12 UTC · 13d agoAI research

28

Rare Not Random Using Token Efficiency for Secrets Scanning

Researcher proposes token efficiency (string length divided by BPE token count) as a better post-regex filter than entropy for secrets scanning, validated on CredData.

The post explores whether Byte-Pair Encoding tokenization can replace Shannon entropy as the primary filter for candidate secrets captured by regex in tools like Gitleaks. It defines 'token efficiency' as string length divided by token count under the cl100k_base tokenizer; secret-like strings such as GitHub tokens tokenize into many small tokens and score low, while natural text scores high. Evaluating labeled secrets from the CredData dataset shows a usable separation, with roughly 2.5 suggested as a minimum cutoff versus Gitleaks' 3.5 entropy threshold. The technique is positioned as a post-regex filtering step rather than a standalone detector.

Lobsters · security·Sep 12, 06:42 UTC · 6d agoResearch

45

Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches

Fathom introduces per-query bit-depth scanning of offloaded 4-bit KV caches, making long-context decoding 1.67x faster on Qwen3-8B at one million tokens.

Fathom is a key-scan method for sparse attention over KV caches resident in host memory, where each query adaptively chooses how many bits of each key channel to read using reverse water-filling over variance-weighted channel importance. The 4-bit K cache is stored channel-major as bit planes, so reading a prefix of planes is an exact t-bit quantizer. At one million tokens on Qwen3-8B, decode steps are 1.67x faster in GPU time than 136-bit scans used by Double Sparsity, Loki, and SparQ r=32, and 92-bit scans match the accuracy of 136-bit scans on real coding-agent sessions. The method requires the index to be offloaded to host memory and matches exact top-k decoding on RULER-style tasks.

Hugging Face daily papers·Sep 14, 20:00 UTC · 3d agoAI research1

35

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.

Hacker News · security·Sep 14, 12:23 UTC · 4d agoAI researchHN 22↑ · 19 comments

15

Subgroup Packing for Batched PASTA Transciphering

Interleaved subgroup packing cuts PASTA homomorphic transciphering server cost by a median 1.60x at the expense of remaining noise capacity.

The paper studies how record word layout affects the cost of PASTA transciphering, where a server converts symmetrically encrypted records into homomorphic ciphertexts. A subgroup layout interleaves records so cyclic shifts preserve positions, reducing required displacements from 255 to 128 versus contiguous packing. In HElib across twelve paired corpora under six homomorphic keys, the median direct-to-subgroup server cost ratio is 1.60 including fresh generation, conversion, and two queries, but with less remaining noise capacity.

arXiv cs.CR·Sep 11, 09:24 UTC · 7d agoResearch1

15

Optimizing Credential Blast Radius Through Trust Boundaries and Delegation Under Post-Quantum Authentication Costs

Academic paper models credential blast radius optimization across trust domains under post-quantum latency costs, cutting expected impact by up to 36%.

The paper formulates the joint selection of trust domains and credential-derivation structures under policy and latency constraints as an NP-hard optimization problem, showing the scalarized two-domain direct-issuance case reduces to a weighted minimum cut. In 195 of 230 exhaustive synthetic comparisons, joint optimization produced lower credential blast radius than choosing boundaries first, especially under chained delegation. A trace-derived replay using measured post-quantum authentication costs found the best design reduced expected impact by up to 36% relative to a single domain within the latency budget.

arXiv cs.CR·Sep 3, 23:42 UTC · 14d agoResearch

26

Has MIMO decoding been proved hard from lattice problems?

Researchers show the published lattice-hardness proof for MIMO decoding fails, as Regev's LWE reduction structure does not carry over to non-modular MIMO.

The paper re-examines Dean and Goldsmith's proposed polynomial-time reduction from lattice problems to MIMO decoding, which adapted Regev's reduction for learning with errors (LWE). Prior works had presented attacks and counterexamples against the construction, leaving the reduction's precise validity unclear. The authors identify which structural features of the LWE reduction fail to transfer to the non-modular MIMO setting, showing the published proof does not establish the claimed hardness of MIMO decoding. They distinguish flaws in the hardness proof from direct attacks on specific parameter choices and do not rule out physical layer security for MIMO systems in general.

arXiv cs.CR·Sep 4, 11:23 UTC · 14d agoResearch

25

Safety for Whom? Boundary-Aware Self-Distillation for Controlled LLM Safety Refusal

A self-distillation safety framework tunes narrow-boundary refusals in Qwen3-8B, raising target-domain refusal to 84.75% while cutting over-refusal from 15.20% to 5.20%.

The paper formulates narrow-boundary safety, where deployments need refusals within specific topics rather than whole subjects, and proposes an offline self-generated framework with controlled topic generation, escalating retries, and harmful-benign boundary pairs. On political persuasion with Qwen3-8B, the method raised target-domain refusal from 9.47% to 84.75% and cut the mean unsafe-response rate across three broader benchmarks from 26.26% to 0.14%. Verified target-model responses reduced over-refusal from 15.20% to 5.20%, and boundary-pair data cut comply-side over-refusal on held-out pairs from 32.94% to 4.16%. Results show data composition controls the safety-usability trade-off and alignment should be evaluated on both sides of the refusal boundary.

Hugging Face daily papers·Sep 2, 20:00 UTC · 15d agoAI safety & security1

32

Better Vector Search for Long Documents: Chunking Inside Manticore Search

Manticore Search added automatic document chunking for vector columns, lifting long-document recall@5 from 55.1% to 83.3% in its benchmarks.

Manticore Search introduced a chunk_strategy option for model-backed vector columns in CREATE TABLE, offering five strategies (truncate, mean, fixed, recursive, sentence) with tunable max_tokens, overlap_tokens, and max_chunks, eliminating external splitters and separate chunk tables. On its 189-page, ~298k-word manual, sentence chunking improved recall@5 from 55.1% to 83.3% and MRR from 0.44 to 0.70, at roughly 2.5x RAM and 4x ingest time. Documents still return as single results; queries are never chunked.

Hacker News · security·Sep 17, 10:30 UTC · 1d agoAI tools & infraHN 31↑ · 1 comments

20

Molecular Déjà Vu: Digit-Level Retrieval of Published Values in Frontier Language Models

Audit of 22 frontier models finds widespread verbatim retrieval of published molecular property values, with higher reasoning increasing recall of memorized numbers.

An arXiv audit tests 22 frontier LLMs across 12 molecular regression benchmarks for verbatim retrieval of published values. More than 50% of the LLMs show verbatim retrieval on five datasets, and identical experiments are flagged 89% more often at a high reasoning level than at the lowest one. Suppressing retrieval moves model prediction errors closer together in relative terms, suggesting predictive capability is not determined solely by memorized values.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:32 UTC · 13d agoAI research1

42

Sharp Reconstruction Bounds for Autoencoders Using the Same Forward Map

Theoretical work derives sharp reconstruction-derivative error bounds for autoencoders using the same forward map, validated on a 798,452-point LiDAR forest scan.

For equal odd input and hidden dimensions d≥3, the paper proves the least uniform reconstruction-derivative error among orientation-preserving diffeomorphisms with Jacobian singular values in [m,M] equals max{1−M(M−m)/2,0}, attained by affine maps. A translated radial rotation can nonetheless reconstruct any prescribed ball exactly with singular values near one, motivating additional conditions for finite-data bounds. On a 798,452-point terrestrial LiDAR forest scan, the theoretical bound at input scale 0.05 was 0.155, about 84% of the mean normalized training error of 0.185.

arXiv cs.AI / cs.LG / cs.CL·Sep 17, 13:04 UTC · 1d agoAI research

12

Recognition-Refusal Misalignment in LLMs: Why Models Answer Structurally Unanswerable Questions

A linear hidden-state direction encodes question impossibility in 1.7B-70B LLMs, but misalignment with the safety-refusal pathway explains why models answer unanswerable questions.

The study examines why instruction-tuned LLMs from 1.7B to 70B parameters answer structurally unanswerable math and code questions instead of abstaining. A single linear direction in the hidden state separates answerable from impossible prompts, showing models represent impossibility before generation, but this direction is nearly orthogonal to the canonical safety-refusal direction. Generation-time steering along the recognition direction changes invalidity-aware behavior dose-responsively, and the geometry is present even at the pretraining endpoint, indicating a routing failure rather than an encoding failure.

Hugging Face daily papers·Aug 28, 20:00 UTC · 20d agoAI safety & security

30

Private Information Retrieval With Arbitrary Privacy Requirements: Introduction and Capacity Results

Researchers formulate private information retrieval under arbitrary graph-based privacy requirements, deriving capacity bounds and introducing pyramid storage graphs.

The paper generalizes classical private information retrieval (PIR) to arbitrary privacy requirements over graph-based storage systems, where each message is retrieved privately from a pre-specified server subset. The authors derive lower and upper capacity bounds for general graphs and exact capacity results for path and cyclic storage graphs. They also introduce a new pyramid storage graph structure that models symmetric message storage and replication patterns.

arXiv cs.CR·Sep 14, 17:03 UTC · 3d agoResearch

15