Skip to content
AI NEWS.ccAI正在发生 未来正在更新
Bookmarks
THE JOURNAL
AI NEWS JOURNAL
AI, IN PERSPECTIVE

Search AI news

Search headlines, summaries and articles to connect the dots.

Newest first

Hacker News Show HN

Show HN: Exact integer LLL lattice basis reduction in C99

LLL, also known as Lenstra–Lenstra–Lovász lattice basis reduction algorithm, is an important algorithm in mathematics and cryptography. clll is an implementation of LLL in C99, which is small, is based on formally verified algorithm, and uses integer arithmetic only (GMP).Claim. clll is also high performant, based on the private benchmarks I have run comparing LLL implementations with exact arithmetic. Comments URL: https://news.ycombinator.com/item?id=50373689 Points: 1 # Comments: 0

Hacker News Show HN

Show HN: SrcWranglr

I spend a lot of time diving deep into C/C++ code bases for various reasons. Normally for Vulnerability Research. I like to get a good feel for the software, it's data structures, control flow, etc. Are all usually important.In the past we have SourceTrail, this is now defunct and its abilities were somewhat limited. If you have thousands to spend you can grab a Understand license... Wait maybe thats SourceNavigator. Either way I wrote SrcWranglr. Its my very first Rust project (congrats to the insufferable Rusteans, I finally cracked and learned Rust).Anyhow SrcWranglr is wicked free, wicked fast, has a modern UI, and features that assist in finding bugs/vulns. You can run semgrep rules over the codebase, or have a fuzz harness generated for you by the program with ease.. Its still super early in development but it already helped me discover a 0day :-).. Give it a shot if you want. I am open to any suggestions and if it is in your heart to contribute let me know. I only get to work on personal projects here and there on account of work... But yea enough babbling.https://github.com/jdefrancesco/SrcWranglr Comments URL: https://news.ycombinator.com/item?id=50380536 Points: 1 # Comments: 0

Hacker News Show HN

Show HN: Using GPUs for other bs than AI – important prime record for the geeks

Hey HN, if you want to be new prime gap hero here is the code that runs and gets you biggest merits (everyone knows what that is in prime world). I spent months to tune it, and in the last few days got couple of top 10 records just by testing. So get you precious GPU time, run the code and become world no 1 in prime merits because it will make you cool, just not to your friends, girlfriend or family. Help the geek cause! Comments URL: https://news.ycombinator.com/item?id=50372526 Points: 1 # Comments: 1

AWS Machine Learning Blog

Smart Approvals in Amazon Quick: Human oversight where it matters

Smart Approvals in Amazon Quick reviews eligible agent actions within your existing controls, reducing unnecessary approval prompts while keeping consequential decisions with a person. See how policy sets the boundary, how a classifier reviews actions, and how AWS CloudTrail and Amazon CloudWatch Logs support audit.

arXiv cs.LG

Stacking-Based Weighting for Large Language Bayes in M-Open Settings

arXiv:2611.03966v1 Announce Type: new Abstract: Large Language Bayes (LLB) transforms a natural language problem description into a collection of candidate probabilistic programs and performs inference within each model, combining their predictions using Bayesian model averaging. While this provides a flexible framework for probabilistic inference without manual model specification, the resulting candidate model set is often misspecified in practice, and likelihood-based aggregation can concentrate on a single model, under-representing uncertainty across the sampled models. We propose a stacking-based aggregation method for LLB that selects model weights by optimizing predictive performance rather than marginal likelihood, while preserving the original language-model-driven model generation and within-model inference pipeline. Because leave-one-out predictive quantities are intractable in latent-variable models, we derive a variational lower bound that yields a tractable ELBO-based stacking objective. Across real-world probabilistic inference tasks, our method achieves comparable predictive performance to Bayesian model averaging while yielding more dispersed model weights, reducing concentration on a single candidate model under misspecification.

arXiv cs.AI

Uncertainty-Aware Resource Orchestration for Agentic AI Systems

arXiv:2611.05392v1 Announce Type: new Abstract: Agentic artificial intelligence (AI) systems powered by large language models (LLMs) execute as autonomous multi-step pipelines that dynamically invoke tools, integrate observations into memory, and iterate until a task is resolved or a resource budget is exhausted. Unlike classical workflows with fixed graphs, the aggregate compute, bandwidth, and end-to-end latency demands of such pipelines are unknown at dispatch time: they emerge at runtime from intermediate observations and stochastic token sampling, yielding heavy-tailed, multi-modal random variables. This unpredictability forces infrastructure orchestrators into a dilemma: under-provisioning risks mid-execution throttling and deadline violations, while over-provisioning wastes scarce edge or cloud capacity. Existing schedulers require a fully known pipeline graph, while edge resource-management methods rely on parametric or stationary demand models, and neither fits the unknown, non-stationary profiles of agentic pipelines. We formalize this setting as the uncertainty-aware agentic orchestration problem, where the goal is to reserve, at dispatch time, compute and bandwidth allocations that cover actual pipeline demands, and to verify that the pipeline can meet its deadline, each with a prescribed probability. We then propose Conformal Reservation for Orchestration (CRO), an online algorithm that translates a sliding window of past execution traces into dispatch-time resource allocations with finite-sample, distribution-free coverage guarantees via conformal prediction. Simulations over heterogeneous task mixes with multi-modal and heavy-tailed profiles show that CRO is the only evaluated method that simultaneously satisfies target probabilistic coverage across all risk levels while, among coverage-feasible methods, attaining the lowest over-reservation, roughly halving the resource waste of the Chebyshev-bound baseline.