推出 HN: Undermind (YC S24) – 用于发现科学论文的人工智能代理
Launch HN: Undermind (YC S24) – AI agent for discovering scientific papers

原始链接: https://news.ycombinator.com/item?id=41069909

来自 Undermind AI 的 Josh 和 Tom 介绍了他们的项目——一个用于复杂科学研究的专门搜索引擎。 他们的目标是通过使用人工智能(AI)模仿人类研究策略来简化查找相关信息的过程。 用户通过自然语言输入与系统交互,允许他们描述复杂的研究查询,然后人工智能进行广泛的搜索。 在与用户进行初步协商后,人工智能需要大约三分钟的时间来收集相关数据,然后才能生成综合报告,这与优先考虑速度而不是准确性和全面性的传统搜索引擎不同。 他们的目标是在特别询问时提供精确的结果,并通过利用复杂的算法来跟踪引用并相应地调整搜索参数,以确保彻底性。 用户可以在 undermind.ai 网站上自行测试该平台,并在发布当天减少 Hacker News 用户的注册要求。 该团队邀请用户提供反馈并与开发人员合作以改进服务。 解释其设计和功能的白皮书可供下载。

科学家转型为企业家的乔什和汤姆创立了 Undermind AI,为复杂的科学研究创建了独特的搜索引擎。 他们的目标是通过在三分钟内提供定制的搜索结果来简化在开展高级学术项目时查找基本信息的劳动密集型过程。 Undermind AI 采用对话语言模型 (LLM) 在启动全面搜索之前澄清用户查询。 搜索结束后,将提交一份详细说明调查结果的报告。 与传统的搜索引擎不同,他们的平台优先考虑准确性,为精确的请求提供高度专业化的结果,同时全面扫描和组织相关数据以确保不会遗漏任何重要内容。 为了实现这些目标,Undermind AI 使用复杂的算法来跟踪引文轨迹,并在发现更多材料时相应地调整其方法。 此外,借助自动化管道,用户可以在整个搜索过程中实时观察他们的发现。 有兴趣的人士可以通过提供的链接自行测试搜索引擎,无需注册即可享受免费试用。 欢迎您提出意见和想法,以改善他们的服务。
相关文章

原文
Hey HN! We’re Josh and Tom from Undermind (https://www.undermind.ai/). We’re building a search engine for complex scientific research. There's a demo video at https://www.loom.com/share/10067c49e4424b949a4b8c9fd8f3b12c?..., as well as example search results on our homepage.

We’re both physicists, and one of our biggest frustrations during grad school was finding research — There were a lot of times when we had to sit down to scope out new ideas for a project and quickly become a deep expert, or we had to find solutions to really complex technical problems, but the only way to do that was manually dig through papers on Google Scholar for hours. It was very tedious, to the point where we would often just skip the careful research and hope for the best. Sometimes you’d get burned a few months later because someone already solved the problem you thought was novel and important, or you’d waste your time inventing/building a solution for something when one already existed.

The problem was there’s just no easy way to figure out what others have done in research, and load it into your brain. It’s one of the biggest bottlenecks for doing truly good, important research.

We wanted to fix that. LLMs clearly help, but are mostly limited to general knowledge. Instead, we needed something that would pull in research papers, and give you exactly what you need to know, even for very complex ideas and topics. We realized the way to do this is to mimic the research strategies we already know work, because we do them ourselves, and so we built an agent-like LLM pipeline to carefully search in a way that mimics human research strategies.

Our search system works a bit differently from casual search engines. First, we have you chat back and forth with an LLM to make sure we actually understand your really complex research goals up front, like you’re talking to a colleague. Then the system carefully searches for you for ~3 minutes. At a high level, it does something similar to tree search, following citation rabbit holes and adapting based on what it discovers to look for more content over multiple iterations (the same way you would if you decided to spend a few hours). The 3 minute delay is annoying, but we’re optimizing for quality of results rather than latency right now. At the end there’s a report.

We’re trying to achieve two things with this careful, systematic agent-like discovery process:

1. We want to be very accurate, and only recommend very specific results if you ask for a specific topic. To do this, we carefully read and evaluate content from papers with the highest quality LLMs (we’re just reading abstracts and citations for now, because they’re more widely accessible - but also working on adding full texts).

2. We want to find everything relevant to your search, because in research it’s crucial to know if something exists or not. The key to being exhaustive is the adaptive algorithms we’ve developed (following citations, changing strategy based on what we find, etc). However, one cool feature of the automated pipeline is we can track the discovery process as the search proceeds. Early on, we find many good results, and later on they get more sparse, until all the good leads are exhausted and we stop finding anything helpful. We can statistically model that process, and figure out when we’ve found everything (it actually has an interesting exponential saturation behavior, which you can read a bit more about in our whitepaper (https://www.undermind.ai/static/Undermind_whitepaper.pdf), which we wrote for a previous prototype.)

You can try searching yourself here: https://www.undermind.ai/query_app/promotion/. This is a special HN link where, for today, we’ve dropped the signup gate for your first few searches. Usually we require login so you can save searches.

We’re excited to share this with you! We’d love to hear about your experiences searching, what’s clear or not, and any feedback. We’ll be here to answer any questions or comments.

联系我们 contact @ memedata.com