保存済みツールを推薦
FOXAI SEARCH

サイト内検索

ニュース記事 604

startup-projects

Show HN: Open-source customer-facing agents

Hi, Dmitri from Radioso here, an open-source platform to design AI agents for customers and visitors in any channel, in the style of Fin/Ada/Decagon. The repo is https://github.com/radioso-ai/radioso and our website is https://radioso.aiToday, your choices are:1. Buy a very expensive service for your vertical (usually starting with $$ five figures monthly) 2. Get a cheap off-the-shelf chatbot that mostly answers FAQs 3. Build your own, and then also build the inbox, human handoff, audit trail and integrations around itAt Radioso we wanted an open-source option that combines the best of all 3. You can integrate it with your own software via API/SDK or your CRM, or run it standalone, either self-hosted or in our cloud.The engine runs multi-step interactions and takes actions: calling your APIs, updating records, booking things. Maybe you’ve tried Parlant; Radioso is the alternative “with batteries included”: RAG, audit trail, customer service inbox, and integrations like Slack and email.Under the hood it’s plain TypeScript + PostgreSQL, works with OpenAI/Anthropic/other models, and is licensed under Apache 2.0 which includes all features (The only thing we keep under EE license is the multi-tenant layer we use to run our own cloud).We have existing customers running it for technical Q&A, course booking, online product recommendations and goods returns, among others, some reaching 92% of conversations automated. We’re currently working on voice support so we can offer a call center.Our ambition is to be “the WordPress of customer-facing AI” :), where people can contribute their favorite plugins and benefit from the ecosystem.Longer term, we think browsing the web will mostly mean talking to your own agent, and when you need a service or a purchase, your agent will talk to the vendor’s agent to get things done. For this, Radioso already publishes an A2A Agent Card and we’re working on the rest. Your Radioso services are also callable over MCP, for customers who already use it.Thanks for your attention. We’d especially love to hear which integrations you’d want, whether you’d self-host it, and what’s stopped you from deploying a customer-facing AI agent so far. Tell us what you think. Comments URL: https://news.ycombinator.com/item?id=50423820 Points: 1 # Comments: 0

翻訳サービスが停止中のため原文を表示しています。
Hacker News Show HN
startup-projects

Show HN: Recap Studio – A Mac screen recorder for clean, polished demos

Hi HN, I made Recap Studio, a Mac app for recording demos and tutorials that look good without a video editor.You record your screen, camera and mic. Then you can zoom in on parts of the video, smooth the cursor, add a background, show the keys you press, and cut out mistakes. The newest feature keeps your face centered in the camera as you move. Comments URL: https://news.ycombinator.com/item?id=50415185 Points: 1 # Comments: 0

翻訳サービスが停止中のため原文を表示しています。
Hacker News Show HN
startup-projects

Show HN: Record, branch, and compare command runs in stdlib-only Python

Hi, this is a package I developed for keeping track of short toy-model development cycles and explaining what changed between runs.The core idea: commands run through the package, and their declared parameters (or injected parameters with --substitute) and outcomes go into a dependency-free ledger stored in the project. Because that ledger lives in the project directory, it has worked well for passing context between different agents. I’ve also found some use for it in CI work. Comments URL: https://news.ycombinator.com/item?id=50417782 Points: 3 # Comments: 0

翻訳サービスが停止中のため原文を表示しています。
Hacker News Show HN
training-alignment

Solver-Admitted Metamorphic Testing of Learned Network Optimization Surrogates

arXiv:2611.08837v1 Announce Type: new Abstract: Equivalent encodings of an optimization problem can produce different learned predictions. Interpreting these differences requires accounting for numerical error and multiple optima. We construct metamorphic tests for optimization solver surrogates with explicit eligibility conditions, output alignment, and numerical thresholds. Reference-solver agreement and independent constraint checks determine which sampled pairs enter the audit. We study alternating-current optimal power flow (AC-OPF), the traveling salesman problem (TSP), the capacitated vehicle routing problem (CVRP), and maximum independent set (MIS). Across five grids, GridSFM-Open violates each of 13 relations on at least one grid, and 12 by more than twice the threshold. Randomly initialized copies of the grid models fail nearly the same relations, so the failures do not require training. Source patches and input canonicalization remove selected discrepancies, but no intervention establishes preserved accuracy and feasibility within the declared margin on every grid. In routing, Policy Optimization with Multiple Optima (POMO) has a single-pass rotation/reflection violation rate that rises from 12.7% to 89.5% between 20 and 100 cities. Graph-Based Diffusion Solvers for Combinatorial Optimization (DIFUSCO) violates the MIS disjoint-union relation on 35.6% of draws. Post hoc normalization within connected components removes these violations on the tested graphs. These findings support reporting metamorphic consistency alongside optimality, feasibility, and accuracy, and validating repair quality separately from consistency.

翻訳サービスが停止中のため原文を表示しています。
arXiv cs.AI
model-evals

Structuring Survey Histories for LLM Digital Twins: A Controlled Study of Background, Decision Procedure, and Evaluation Profiles

arXiv:2611.08730v1 Announce Type: new Abstract: LLM-based digital twins aim to predict how individuals would respond in new settings from representations of their prior responses. Existing evidence that compression of survey histories need not reduce predictive accuracy suggests that representation structure, rather than information volume alone, may be an important design choice. We study BDE, a fixed representation that organizes each respondent's survey history into Background, Decision procedure, and Evaluation. We evaluate it on Twin-2K-500 (Toubia et al., 2025) by predicting each respondent's held-out answers on 17 tasks. In a paired evaluation with 100 respondents, a fully inferred BDE profile improves overall accuracy over the raw survey transcript by 1.27 percentage points (pp) on gpt-5.4-nano (p < 0.01) and 1.19 pp on gpt-5.4-mini (p < 0.001). Three analyses then examine the schema, extraction depth, and component composition. Against a length-matched free-form profile written from the same transcript by the same extractor, BDE improves pricing accuracy on both simulators (2.15 pp on nano, p < 0.01; 1.38 pp on mini, p < 0.05), while its overall advantage is significant only on nano (1.05 pp, p < 0.05). Allowing deeper inference during extraction yields no statistically significant gain on either simulator. By contrast, adding Evaluation to a Background--Decision procedure profile improves overall accuracy by 1.44 pp on nano (p < 0.001) and 1.22 pp on mini (p < 0.001). These results indicate that the advantage over raw transcripts is not explained by compression or length alone, and attribute it primarily to profile composition rather than deeper extraction.

翻訳サービスが停止中のため原文を表示しています。
arXiv cs.CL
copyright-privacy

Transporting the Past: An Optimal Transport View of Backtracking Counterfactuals

arXiv:2611.08682v1 Announce Type: new Abstract: We study backtracking counterfactual inference for Structural Causal Models (SCMs) through the lens of optimal transport. In SCMs, a factual observation generally induces a posterior distribution over exogenous variables, making counterfactual inference inherently distributional. We introduce two complementary frameworks that transport this posterior onto the set of exogenous configurations satisfying a desired counterfactual query. The first constructs a natural pointwise projection and is suitable when the transported exogenous distribution can be used directly. The second enforces mutual independence among counterfactual exogenous variables, so that the transported variables remain interpretable as genuine exogenous noises of the same SCM. We show that both frameworks are consistent with the original backtracking counterfactual principle, and we propose marginal, penalty-based, and hard-constrained solvers for finite-posterior settings. Synthetic experiments on non-bijective SCMs illustrate the geometry of the problem and reveal trade-offs among transport cost, counterfactual constraint satisfaction, and preservation of exogenous independence.

翻訳サービスが停止中のため原文を表示しています。
arXiv cs.AI