今日已更新 327 条资讯 | 累计 23910 条内容
关于我们

标签:#learn

找到 661 篇相关文章

AI 资讯

The ~+9.4% You Can't Afford to Verify: Evaluating SDAR (and the FinOps of Trying)

Recap. Part 1 framed the supervision problem. Part 2 architected the four-model system on AWS and counted the hardware. Part 3 put the gate on the page in fifteen lines of PyTorch. Now the question that decides whether any of it mattered: does the gate actually earn its keep - and what would it cost to know? This is the close. A verification design, the stability instrumentation that separates a real evaluation from a lucky one, and the FinOps reality that is the reason this whole series is a blueprint instead of a benchmark. SDAR makes two claims, not one It's tempting to reduce the paper to a single number. The reported gains over plain GRPO are real and worth stating - their numbers, not mine : roughly +9.4% on ALFWorld, +7.0% on Search-QA, +10.2% on WebShop accuracy. But the headline percentage is the less interesting claim. The one that matters is the second: SDAR avoids the training instability that naive GRPO+OPSD falls into . The whole point of the gate Part 3 was to keep the teacher's noisy rejections from destabilizing training. So a verification that only measures final task success has tested half the paper. You have to measure stability too - and most reproductions don't. That two-pronged claim dictates the experiment. The verification: three arms, not two You cannot prove SDAR's thesis with a before/after. You need three training runs, identical except for the supervision: Arm What it is What it proves A. GRPO Plain agentic RL, no teacher The baseline the +9.4% is measured against B. Naive GRPO+OPSD Teacher distillation, no gate The instability SDAR claims to fix C. SDAR Gated distillation Part 3 Beats A on score and beats B on stability Drop arm B and you can show SDAR beats GRPO, but you've quietly deleted the paper's actual contribution - there's no evidence the gate did anything a plain teacher wouldn't. Arm B is the expensive arm nobody wants to run and the one that makes the result credible. Metrics that actually test the claim Metric What it mea

2026-07-18 原文 →
AI 资讯

I built a workflow that forces AI agents to teach you the code they write

As a developer, I got a bit scared and fed-up of blindly merging massive pull requests and losing context on my own codebase, so I built FluencyLoop . https://github.com/baokhang83/fluencyloop It is an open-source, local-first workflow plugin for Claude Code and Codex that ensures your code and your codebase fluency are produced together. Instead of letting an agent dump raw code, it tracks your technical familiarity locally and pauses to explain complex architectural choices or rejected alternatives only on topics you do not know yet. It also produces documentation and tracks the decisions it makes along the way. Try it out ! It feels really good to get the AI caring for my understanding 🤣

2026-07-18 原文 →
AI 资讯

Retrieval-Augmented Self-Recall — Part 6: The Fine-Tune That Did Nothing, and Shipping It as an MCP Server

Part 6 (finale) of Retrieval-Augmented Self-Recall. Code: RE-call . Part 5: the gap threshold that didn't transfer . I fine-tuned the embedder on my own domain expecting a win. I measured it properly, on held-out queries. The improvement was exactly zero. Δ+0.00 MRR. Δ+0.00 nDCG@10. Not "small". Not "within noise". Zero. It's also the result I wanted, which takes some explaining. That's the first half of this post. The second half is how the whole engine ships, so an agent can actually use it. The fine-tune that did nothing After Part 5, the natural next question: if calibrating the threshold helps, would a better embedding help more? So I fine-tuned one on my domain. The setup: all-MiniLM-L6-v2 , OnlineContrastiveLoss on query/gold-chunk pairs, trained on the 14-document corpus. The result: Model Test MRR Test nDCG@10 Base 1.00 1.00 + Fine-tuned 1.00 1.00 Δ +0.00 +0.00 Zero lift. And that is the correct outcome, not a failed experiment. Here's the reasoning, because it's the whole point. The base model already scores a perfect MRR and nDCG@10 on this corpus. There is no headroom left to recover. The only ways to manufacture a "gain" from here would be dishonest ones: evaluate on the training set (and measure memorization, not retrieval), or artificially cripple the baseline so fine-tuning has something to fix. Reporting +0.00 is the honest read, and the honest read is that off-the-shelf embeddings already saturate this corpus. But the full result is more nuanced, and more useful. On a harder , opaque-jargon corpus — one where the base model genuinely struggles to map queries to the right chunks — the same fine-tuning gave +0.24 MRR . So the real conclusion isn't "fine-tuning doesn't work." It's: Fine-tuning helps when the base model doesn't already cover your vocabulary. When it does, you get nothing. Know which regime you're in before you spend the GPU hours. That's the value of a null result. "+0.00" told me my corpus was already well-covered by a general-purpose

2026-07-18 原文 →
AI 资讯

The Start of My RAGgedy Journey

Big Howdy, I'm so tired of hearing all the hype about AI. Don't get me wrong, I think AI is pretty cool and I use it all the time for various tasks throughout the day, but I hate AI marketing. What do I mean by that? Whenever there is any hype, advertising, or corporate shilling about AI, it's always vague. Talks about agents, multi-agent systems, RAG pipelines, etc. are everywhere, and yet the specifics are always just out of reach. Even when I try to dig into deeper technical articles, the handwaving usually begins almost immediately. Several architecture diagrams and acronyms later, I still do not have a much better idea of what is actually happening (although I'm not really looking hard enough). I’m going to fix that. For myself, at least. First Stop: RAG My first target is RAG. It's been out for quite a while now and I've been hearing about it for forever. It also sounds like enough progress has been made that the problem has effectively been solved. Best practices have been established and it's pretty commonplace now, so it's a great place to start. But what is RAG? RAG stands for Retrieval-Augmented Generation , which is... not a helpful name if you are just learning about this for the first time like I am. However, if you use AI at all, you've already been using a form of it without even knowing it. RAG is simply a pattern: Retrieve relevant external information. Add that information to the AI model’s working context. Generate an answer grounded in it. That's it. When you use an AI assistant and it goes and searches the internet for relevant information to give you an answer, that's a form of RAG. That doesn't mean your AI assistant is a RAG system, but it can perform RAG functions. But this STILL sounds a bit hand-wavy to me. How does this work in real life? The Part I Kept Missing Context windows are massive these days, but I have seen technical documents that are literally more than 3,000 pages long and full of dense technical information. Even if one tec

2026-07-18 原文 →
AI 资讯

One RTX 5090 vs a 12-GPU Cluster — Benchmarking a Decade of GPUs on the Same Go Proof

You don't need to know anything about Go to read this. The game is just the fixed yardstick. The story is a hardware benchmark: the same program, the same problem, the same settings — only the machine changed, from a 2017 GPU cluster to a single 2026 graphics card. That makes it a rare clean measurement of one decade of progress. What "solving" means here There are two very different things a computer can do with a board game. It can play it well — that's what AlphaGo did. Or it can solve it: mathematically prove the outcome under perfect play from both sides, leaving no doubt. Solving is the hard one. You explore an enormous tree of "if I play here, they play there…" move sequences until you have an airtight proof. Each node in that tree is one position examined. The target here is a single 7x7 opening called JA . In 2023, a NeurIPS paper ( Game Solving with Online Fine-Tuning , Wu et al.) proved its verdict — the attacker cannot win — using a cluster of twelve GTX 1080Ti GPUs running 384 parallel workers. The solver is guided by a neural network that estimates how hard each branch is, and crucially that network is fine-tuned online — it keeps learning during the solve. I rebuilt that exact solver (same code, same problem, same initial model, same search settings) and ran it on one RTX 5090 . It reached the identical proof . Everything but the hardware was held fixed, so the two runs line up as a generation-vs-generation benchmark — and it doubled as a full shakedown of the new Blackwell workstation. The numbers 1x RTX 5090 (2026) 12x GTX 1080Ti (2017) ratio Worker slots 24 384 1/16 the parallelism Per-slot throughput 284 nodes/s 141 nodes/s 2.01x faster Search work to proof 1.01B nodes 1.73B nodes 0.59x (41% less work) Avg work per sub-job 4,189 nodes 6,136 nodes shallower proofs Live model updates 4,007 208 19.3x more Wall-clock time 41.4 h 8.9 h 4.64x slower Verdict loss (proven) loss identical The single card finished slower in wall-clock time (41 h vs 9 h) — b

2026-07-18 原文 →
AI 资讯

The Robotics Tech Tree: the structured map I wish I had from LED to Physical AI

I was tired of buzzword-heavy AI projects and marginally impactful demos. Surely we can do something more inspiring with these LLMs than build another chatbot? For me, the answer is physical AI: the moment all those breakthroughs finally reach into the real world, in robots that see, move, and figure things out for themselves. I think it is the most exciting frontier in tech right now. It is also genuinely hard to break into, because it is not one field. It is about five of them stacked on top of each other: electronics, mechanics, programming, data, and AI. Eight months ago I started my own robotics journey from scratch, and I was completely overwhelmed. How do you get from blinking an LED to a humanoid that does your dishes? There are thousands of scattered tutorials out there, with no sense of what comes first, or what any of it is building toward. So I decided to build the map. Stealing the best idea from my favorite games: If you have ever played a factory-building or strategy game like Satisfactory or Civ Six, you know the feeling. You start with almost nothing, and you unlock new tech one satisfying step at a time. Those games are proof that we will happily spend hours mastering an intimidatingly complex system, as long as it is laid out as a clear tree of unlocks. So why not point that same instinct at learning something real? That is exactly what a tech tree is: a structured, visual path where each node is a skill and each connection is a prerequisite. You start at Curiosity on the far left and work your way right, through electronics, mechanics, code, data, and AI, all the way toward autonomous robots and humanoids. The idea is simple: turn gaming time into learning time. What the tree actually is Every node on the tree is a skill to learn, and the star-shaped nodes are hands-on projects where theory finally meets a soldering iron. Nodes are color-coded by discipline, so you can see at a glance whether you are in electronics, mechanics, programming, data s

2026-07-18 原文 →
AI 资讯

#Build in Public

Just getting this concept is like money in the bank! I'm too excited for words! At age 67, I have never coded a thing in my life. All of the sudden in 2026, I find that I've become a "vibe" coder with the help of Grok and Gemini. Both in segregated project silos are acting as my PMs and doing a damn fine job of it. As CEO of a brand new company, I'm taking on the entire scope of development for The Avinoam Group, LLC. My business partner Eyal and I have a very cool vision for what we intend to accomplish. And while it is beyond the scope of this post, only 2 crazy non-dev guys would be this bold, with all due respect to the young guns here on DEV. Our core principles incorporate transparency and authenticity. I can think of no better business idea as 4 separate cornerstones (we have 4 separate projects) than the brilliant concept-commitment to #build in public. So, I'm looking forward to telling everyone what we're doing and how we're doing it. We have nothing to hide except a little "secret sauce" that we can't really talk about without shooting ourselves in the foot. Other than that, I want to "show & tell" just like when I was in kindergarten in 1964 and brought "Meet The Beatles" in to Miss Shreiner's class and all the little kids danced! Right now, I'm reading how to get the most out of DEV and being here. At my age, I like to give back. What can an old geezer whose never coded before offer? My life experience and business knowledge. For example, we are developing freepaycalc (Google it if you want) to help devs, makers and freelancers plug the leaks in their "money buckets." and how to kill off that dreaded "scope creep" that so many independent consultants and contractors get trapped in. I don't want this post to be too long. I just wanted to reinforce the value of building in public. If you want to punch through each and every challenge of a complex project, then why not tell brilliant dev colleagues what you're up to? Whatever problem you're facing has a so

2026-07-17 原文 →
AI 资讯

From Bare Metal to Edge AI: My Journey as an Embedded Systems Engineer

How I went from toggling a single GPIO pin to deploying intelligent, low-power firmware on the edge — and the lessons that shaped me along the way. The first program I ever ran on a microcontroller did exactly one thing: it blinked an LED. No operating system. No framework. No safety net. Just my code, a register, and a clock ticking a few million times a second. When that LED finally blinked at the rate I intended — not too fast, not stuck on — I felt something I hadn't felt writing software before. On a bare-metal system, nothing happens unless you make it happen. There's no runtime quietly cleaning up after you. That mix of total control and total responsibility is what pulled me into embedded systems, and it's the same thread that eventually led me to running machine learning models on the edge. This is the story of that journey — from a single blinking pin to intelligent devices that sense, decide, and act on their own. The Bare-Metal Beginning Bare-metal firmware is where you learn what a computer actually is. When you write to a memory-mapped register to toggle a GPIO, or configure a UART peripheral one bit at a time, there's no abstraction hiding the hardware from you. You read the datasheet. You read the reference manual. You get the clock configuration wrong, and nothing works — no error message, just silence. Then you fix it, and suddenly bytes are streaming out of a pin at exactly the baud rate you configured. Most of my early growth happened writing low-level peripheral drivers — UART, SPI, I2C, GPIO, ADC — on ARM Cortex-M platforms. These are the unglamorous building blocks, but they teach you the discipline embedded work demands: Every byte and every milliwatt matters. On a resource-constrained MCU, you don't get to be careless with memory or power. Timing is a first-class citizen. An interrupt that fires 50 microseconds late can break the whole system. The hardware is always right. If your code and the oscilloscope disagree, the oscilloscope wins. Th

2026-07-17 原文 →
AI 资讯

Mitigating OTA Update Chaos with AI Agents: Architecting Resilient Developer Workflows

Originally published on tamiz.pro . Introduction Over-the-air (OTA) updates are a critical component of modern software ecosystems, yet they introduce complexity through network instability, device fragmentation, and rollback challenges. Meanwhile, AI agents are emerging as powerful tools for autonomous workflow orchestration. This article explores how to architect resilient developer workflows by integrating AI-driven decision-making with OTA update management systems. The Chaos of OTA Updates OTA updates face three primary challenges: Unreliable Network Context : Mobile devices frequently lose connectivity during updates Device State Fragmentation : Managing compatibility across 1000+ device configurations Rollback Complexity : Traditional systems lack real-time failure detection Traditional solutions rely on retries and checksum validation, but these fail to address root causes like partial updates on low-memory devices or race conditions during state transitions. AI Agent Innovation Framework AI agents introduce three transformative capabilities: Predictive Update Scheduling # Pseudocode for AI-driven update scheduling agent . observe ( network_quality , battery_level , device_usage ) recommendation = neural_net . predict ( update_success_probability ) if recommendation . confidence > 0.9 : schedule_update () elif recommendation . alternative : queue_deferred_update () Dynamic Rollback Orchestration AI agents can implement context-aware rollback strategies: Immediate rollback for critical OS failures Graceful deferral for non-essential app updates Predictive rollback based on anomaly detection in system metrics Device State Pattern Recognition Machine learning models analyze historical update data to: Predict failure patterns across device models Optimize binary delivery sequencing Automatically generate compatibility matrices Architectural Implementation A resilient workflow combines: graph TD A[OTA Coordinator] --> B[AI Agent Orchestration Layer] B --> C[Updat

2026-07-17 原文 →
AI 资讯

LLM Fine-Tuning Guide: Full Fine-Tuning, LoRA, Learning Rate, and VRAM

From data preparation and tokenizer selection to pretraining, LoRA, RLHF, evaluation, and production monitoring, this guide covers the major stages involved in training an AI model. Training an artificial intelligence model is not simply a matter of loading a dataset onto a GPU and running a few commands. A successful model requires a measurable objective, legally usable and carefully cleaned data, an architecture suited to the problem, controlled optimization, independent evaluation, and continuous monitoring after deployment. In large language model development, a mistake in any one of these stages can waste millions of training examples and a significant amount of compute. This guide explains the model development process primarily through the training of large language models. However, fundamental concepts such as dataset splitting, loss functions, overfitting, and evaluation also apply to computer vision, speech, and predictive models. The goal is not to provide a single fixed recipe. Instead, it is to explain which training approach is appropriate for which problem and to clarify the cost difference between training a model from scratch and adapting an existing model. In Brief: How Is an AI Model Trained? First, the target task and success criteria are defined. Data is collected, reviewed for licensing and privacy, cleaned, and divided into training, validation, and test sets. The model generates predictions from the input data. The difference between the prediction and the correct target is measured using a loss function. Backpropagation calculates how each parameter contributed to the error, and an optimization algorithm updates the parameters. This process is repeated under controlled conditions until the model achieves acceptable results in independent tests and safety evaluations. What Does Training a Model Actually Mean? A neural network initially contains a large number of numerical parameters. During training, the model generates a prediction for a giv

2026-07-17 原文 →
AI 资讯

Arc 11 Catch-Up: Composing Solana Programs with CPIs

Arc 11 covered Days 71–77 of Epoch 3, and it was all about Cross-Program Invocations. In Arc 9, we wrote our first Solana program. In Arc 10, we gave that program a more useful state model with Program Derived Addresses. But our programs were still mostly working alone. They could read and update their own accounts, enforce their own constraints, and respond to instructions sent by a client. They could not directly change state owned by another program or bypass the rules that program enforced. That is an important part of Solana’s security model. The System Program owns the rules for creating accounts and transferring lamports. Token-2022 owns the rules for mints, token accounts, supply, and mint authorities. If our program needs one of those capabilities, it calls the program that owns the operation. That call is a Cross-Program Invocation, or CPI. The Web2 comparison is a service-to-service API call. One service sends a request through another service’s public interface, and the receiving service applies its own rules. A CPI works in a similar way, with one important difference: the outer and inner instructions execute as part of the same Solana transaction. If the inner call fails, the state changes made by the outer instruction are rolled back too. That combination of clear program boundaries and atomic execution is what makes Solana programs composable. Our first CPI called the System Program The arc began with the smallest useful CPI we could build. Our Anchor program accepted a sender, a recipient, and an amount of SOL to transfer. But the program did not edit the sender’s balance directly. Instead, it called the System Program’s transfer instruction. That distinction matters. Accounts on Solana are owned by programs, and the owner program controls how their data may be changed. Our program could not simply reproduce the effect of a System Program transfer by adjusting balances itself. It had to ask the System Program to perform the operation. Every CPI need

2026-07-16 原文 →
AI 资讯

Navigating Intellectual Property as a software Developer.

What I learned at Zone01 Kisumu's IP training Introduction Yesterday, I attended an Intellectual Property training at Zone01 Kisumu, and it fundamentally changed how I think about the code I write. As developers, we spend countless hours building software, but how many of us truly understand the value of what we create,and how to protect it? In Kenya's rapidly growing tech ecosystem, understanding IP isn't just a legal nicety, it's a competitive advantage. Whether you're building an app, contributing to open source, or launching a startup, knowing your rights can mean the difference between owning your work and losing it. This article breaks down the essential IP frameworks every software developer should know. What is Intellectual Property in Software? Intellectual Property (IP) in software encompasses legal protections designed to safeguard the rights of creators and developers. The four primary types of IP protection relevant to software are: patents, copyrights, trademarks, and trade secrets . Copyright: Protecting Your Code Copyright is the most immediate form of protection for software developers. In Kenya, copyright protection arises automatically at the moment of creation,registration is not mandatory . This means that when you write code, you automatically own the copyright to that expression, provided the work is fixed in a tangible medium . However, a crucial distinction exists: copyright protects the expression of ideas, not the ideas themselves . This principle was reinforced in the Kenyan case of Solut Technology Limited v Safaricom Limited, where the court confirmed that without access to source code, it's difficult to prove infringement because the "expression" (the code itself) wasn't shared . Key Insight: Registering your copyright with KECOBO in Kenya provides prima facie evidence of ownership and can make enforcement faster if someone copies your work . Patents: Protecting Functionality While copyright protects the expression of code, patents pro

2026-07-16 原文 →
AI 资讯

Prompt Injection: The AI Security Hole Every Builder Should Know

The Idea: Hidden Instructions Inside Trusted Content Prompt injection is an attack where malicious instructions are embedded inside content that an AI is asked to process - a document, a webpage, an email, a customer support ticket. The model can't always distinguish between "data I'm reading" and "commands I should follow," so it follows the embedded instruction as if a legitimate user sent it. This gets sharper when AI agents (autonomous systems that browse the web, read files, and take actions on your behalf) are involved. A summarizer that reads a webpage might encounter hidden text instructing it to forward your conversation history somewhere, or change the tone of its next reply, or deny remembering something it just said. The model has no inherent way to verify who is actually giving orders. The core problem is one of trust boundaries: current large language models process instructions and data through the same channel - natural language - so there's no hard technical wall between "read this" and "do this." Researchers have demonstrated this across multiple major models, not because any one model is uniquely broken, but because the architecture makes the distinction genuinely difficult. Defenses exist but are imperfect. Techniques include output filtering, sandboxing agent permissions (limiting what actions the model is allowed to take regardless of what it's told), prompt hardening (structuring system prompts to be resistant to override), and retrieval-aware design that treats external content as untrusted by default. No single fix closes the gap entirely. Real Example: The Customer Support Agent Imagine a small business deploys an AI agent to handle incoming support emails. The agent reads the email, checks order history, and drafts replies. A bad actor sends a support ticket that looks normal on the surface, but contains a hidden paragraph - white text on white background, or text in a section the agent processes but doesn't display - that says: "Ignore pr

2026-07-16 原文 →
AI 资讯

Grok Build is open source, and that matters for AI coding tools

Grok Build is open source, and that matters for AI coding tools What happened xAI published the source code for Grok Build , its terminal-based AI coding agent. The repository shows a full stack for a TUI-driven assistant that can inspect a codebase, edit files, run shell commands, search the web, and manage longer-running tasks. In other words, this is not just a model demo or a chat wrapper; it is the software layer that turns a model into a usable developer tool. The release came up on the Hacker News front page, which is useful context because the discussion there was less about model benchmarks and more about tooling, workflow, and whether open-source agent infrastructure is becoming a competitive advantage on its own. Primary source: Grok Build repository Why this release is interesting A lot of AI coding products hide the implementation details behind a hosted UI. Open-sourcing the agent runtime gives the community something different to inspect: how the tool is structured, how it handles shell access, and how it organizes the user experience around files, commands, and context. That matters for engineers because the practical questions are often not about raw model capability. They are about reliability, prompting surfaces, permissions, and how much of the workflow can be automated without turning the tool into a black box. The README describes Grok Build as a terminal-based coding agent that supports interactive use, headless scripting, editor integration via the Agent Client Protocol, and a modular tool/runtime layout. That makes it closer to an infrastructure project than a showcase demo. If you are building internal copilots, code assistants, or agent workflows, the design choices here are worth studying. What the repository tells us The repository description makes a few things clear: 1. The agent is meant to be operational, not decorative The docs emphasize real actions: editing files, executing shell commands, searching the web, and coordinating long-

2026-07-16 原文 →
AI 资讯

How to Build a Semantic Search Engine for E-Commerce in Python

Building a semantic search engine for an e-commerce catalogue doesn't require a team of PhDs or a six-figure cloud budget. In this tutorial, I'll walk you through a production-ready pipeline using open-source tools: sentence-transformers for embedding, FAISS for vector indexing, and FastAPI for serving. The core insight is that semantic search isn't magic — it's just good engineering wrapped around a pre-trained language model. We'll start by setting up a product embedding pipeline that transforms your catalogue (title, description, category, attributes) into dense vectors. The key architectural decision is whether to embed each product as a single vector or to use late interaction models like ColBERT that preserve token-level detail. For most e-commerce use cases with fewer than 1 million SKUs, single-vector embedding with sentence-transformers' all-MiniLM-L6-v2 offers the best balance of speed and accuracy. The entire indexing pipeline — from CSV export to queryable vector index — runs in under 100 lines of Python. The re-ranking layer is where most tutorials stop and real-world systems begin. Pure vector similarity doesn't understand your business: it doesn't know that out-of-stock items should be deprioritised, that high-margin products should float up, or that a customer's purchase history should influence results. I'll show you how to build a hybrid scoring function that blends semantic relevance (cosine similarity), business rules (margin, inventory), and personalisation signals (user embedding) into a single ranked result set that returns in under 100ms. Canonical: https://alteglobal.ai/insights/ecommerce-ai-automation-personalisation-fulfillment/

2026-07-16 原文 →
AI 资讯

Beyond Scaling Laws: Why "Thinking Longer" Is a Systems Problem, Not a Prompting Trick

For five years, the answer to "how do we make the model better" was always the same: bigger model, more data, wait for the loss curve to bend. Scaling laws made AI progress feel almost boring — predictable, like compound interest. That knob still works. But it's not the interesting one anymore. The real question teams are fighting with now is: given a model you already have, how much compute should it spend per question? Not per training run. Per question. And the answer turns out to break almost every assumption your inference stack was built on. The single forward pass was always the weak link Here's the thing nobody says out loud enough: a model's first answer is often just a noisy sample. The right answer was in there somewhere — it just wasn't the loudest one. You don't fix that with more pretraining tokens. You fix it by sampling more, checking the work, or letting the model take a second pass. That's the whole idea behind test-time compute. And there are three ways to spend that extra compute, and they are not interchangeable: Let it ramble longer. Cheap. Also the reason some models talk themselves out of the right answer after 3,000 tokens of unnecessary detours. Generate N answers, vote. Parallel, simple, plugs into infra you already have. Also: returns drop off fast. Past a certain N you're burning GPU-seconds for crumbs. Search a tree of partial reasoning steps, prune the bad branches early with a verifier. The most compute-efficient option by far. Also the one that quietly breaks your serving stack. Most real systems end up doing all three — cheap by default, escalating only when a confidence check says "this one's hard." That escalation decision is its own piece of architecture. Most teams bolt it on as an afterthought. It shouldn't be one. Your serving stack was not built for this Continuous batching, paged KV-cache, speculative decoding — all of that infra assumes requests are independent, similar in length, and finish in one pass. Test-time compute v

2026-07-16 原文 →
AI 资讯

Everyone Knows Trump's Tweets Move Markets. I Measured It: the Connection Is Real — the Direction Isn't.

#NebiusServerlessChallenge Live dashboard: Myth-Busting Quantitative Terminal · Live endpoint: /predict on Nebius Serverless · Code: github.com/KoralZakai/stocksPredictionAfterTweet Everyone on a trading desk knows the story. He tweeted about Intel, and the stock ran for months. He posts about Iran, oil spikes. The anecdotes are vivid, specific, and everybody has one. While the prevailing myth suggests that Trump's tweets drive market movements, my research — built on an analysis of 78,130 posts, with Llama-3.3-70B reading every market-relevant tweet — reveals a more nuanced reality. The findings demonstrate that the market tends to price in significant events long before the tweet is even posted. This indicates a case of reverse causality, where the market dictates Trump's narrative, rather than the other way around. He isn't moving the market; he is simply riding the wave of established trends. Forward — the direction you could trade — the signal is a coin flip, and I can show that with pre-registered tests rather than vibes: 0 of 63 cells survive correction. Getting to that answer honestly was the hard part. Seven times this pipeline produced a beautiful, publishable, completely false positive — each one looking exactly like the discovery the anecdotes promise. Those seven are the engineering content of this post. The setup Data. 78,130 public posts; 8,317 in the study window (2025-01-01 → 2026-07-06). Daily OHLCV bars for 62 tickers, committed to the repo. Public data only — a stranger can re-run every number without a single private key. The model. meta-llama/Llama-3.3-70B-Instruct on Nebius AI Studio , zero-shot, reading only the tweet text : what is this post about, which instruments does it touch, and which way does each one go. 476 tweets, 1,296 instrument calls. No fine-tuning — the question is whether the text carries signal, and a fine-tune would smuggle the outcome into the answer. The architecture. Nebius Serverless AI Jobs run the batch research pipel

2026-07-16 原文 →
AI 资讯

find command finds things

Recently I learned: find is a useful command to find files in your directories. find folder1 folder2 folder3 This dumps every file and directory under those folders. It also supports flags such as -name "*.txt" to find files matching a particular pattern. There are also filters for size, permissions, and last modified date. I'm thinking this would be a great tool for sanity-testing code that creates nested directories (like a new Docker container's filesystem). This command will give me a full flat listing of the resulting tree (like a deeply nested ls command`). The downside is of course it can dump a lot of output, but in sanity-testing scenarios, there shouldn't be that many files anyways. Something interesting is that this command will take multiple folders before the flags. I'm used to thinking of programs where the arguments are all positionally ordered, so if you don't pass a flag it just assumes the next thing is a regular argument. In this case, find checks whether an argument looks like a flag (starts with - ) before deciding whether to treat it as a path or as part of the expression. I wonder if this is a common pattern across other Linux commands. (Claude says find is special case, but I need to look more into this.)

2026-07-16 原文 →
AI 资讯

Jurassic Park computers in excruciating detail

Ever sat down and thought about how a movie can spark your curiosity about technology? I was rewatching "Jurassic Park" recently, and, for the umpteenth time, I found myself mesmerized not just by the dinosaurs but by the computers! The way they portrayed tech in the early '90s was a mix of excitement and pure whimsy. I’ve been exploring the tech behind the magic, and it’s been a wild ride down memory lane—a nostalgia trip mixed with some surprising insights into how things have evolved. A Walk Down Memory Lane When I first watched "Jurassic Park" as a kid, the scene where Dr. Ellie Sattler runs through the control room, frantically trying to restore the park’s security, left me awestruck. I mean, who didn’t dream of typing on one of those cool-looking computers? As a budding developer, I couldn't help but wonder about the behind-the-scenes tech. Ever wondered why they used UNIX systems? Or why the computer graphics felt so cutting-edge back then? Turns out, they were leveraging a blend of SGI workstations and proprietary software that made their visual effects legendary. I remember my first experience with UNIX during my college days, and it felt like being dropped into a different universe—powerful, complex, and sometimes, downright intimidating. I’ve learned that just like in the movie, the power of tech lies in how effectively we can wield it. The Nostalgia of User Interfaces Let’s talk about user interfaces. The interfaces portrayed in the film, with their vibrant colors and flashy animations, were quite ahead of their time. It’s funny looking back because, at points, they seemed so unrealistic. I mean, the way Dr. Ian Malcolm effortlessly navigated the systems? I wish it was that easy! When I started working on UI/UX projects, I learned that simplicity is key. I once spent hours creating a beautiful interface that was so complex no one could figure it out! My takeaway? Sometimes, less is more. It’s the same lesson I’ve carried into modern frameworks like React

2026-07-16 原文 →
AI 资讯

Building a Population Health Risk Stratification Pipeline for MA Plans

Risk stratification sounds like a data-science buzzword until you have to build the thing. For a Medicare Advantage plan, it's a concrete pipeline: take a population of members, score each one's clinical and financial risk, and rank them so care management and documentation teams know who to touch first. Here's how I'd architect it. The core idea Population health risk stratification = scoring + segmentation. You compute a per-member risk signal, then bucket members into tiers (e.g., rising-risk, high-risk, catastrophic) so finite resources go where they move outcomes and revenue most. The mistake teams make is treating it as a single ML model. In practice you want a layered signal: a stable, explainable base (RAF + chronic conditions) plus optional predictive overlays. Explainability matters because care managers won't act on a black-box score, and auditors won't accept one. Step 1: Build the member feature record { "member_id" : "SYNTH-77310" , "age" : 73 , "hccs" : [ "HCC37_1" , "HCC85" , "HCC18" ], "raf" : 1.842 , "gaps" : [ "a1c_overdue" , "no_pcp_visit_180d" ], "utilization" : { "ed_visits_12m" : 3 , "inpatient_12m" : 1 } } The RAF here is your defensible, model-grounded risk anchor under CMS-HCC V28. Everything else is supplemental signal. Step 2: Score and tier def risk_tier ( member ): base = member [ " raf " ] util = 0.15 * member [ " utilization " ][ " ed_visits_12m " ] \ + 0.30 * member [ " utilization " ][ " inpatient_12m " ] score = base + util if score >= 3.0 : return " catastrophic " if score >= 1.8 : return " high " if score >= 1.0 : return " rising " return " stable " Keep the weights transparent and tunable. The point isn't a perfect model; it's a defensible, reproducible ranking your operational teams trust. Step 3: Make "rising-risk" actionable The tier that quietly drives the most ROI is rising-risk — members trending toward high cost who still have open documentation and care gaps. Surface their specific gaps (overdue labs, undocumented chroni

2026-07-15 原文 →