Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
mingtianzhang
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
11 ms
·
31.
▲
by
mingtianzhang
1y ago
Thanks for the great question! We actually use a reasoning-based, vectorless approach. In short, it follows this process: 1. Generate a table of contents (ToC) for the document. 2. Read the ToC to select a relevant section. 3. Ext
32.
▲
by
mingtianzhang
1y ago
thanks!
33.
▲
by
mingtianzhang
1y ago
Great post, I am wondering if this system includes financial report analysis.
34.
▲
Show HN: Long PDF Reader MCP
(pageindex.ai)
5 points
by
mingtianzhang
1y ago
|
5 comments
35.
▲
Handle in-document reference in RAG
(claude.ai)
6 points
by
mingtianzhang
1y ago
|
1 comments
36.
▲
by
mingtianzhang
1y ago
Many RAG systems handle in-document references (like “see appendix for details”) by building graphs or other preprocessing structures. The idea is to make sure cross-references are resolved before retrieval. But with reasoning-based RAG, yo
37.
▲
by
mingtianzhang
1y ago
This paper introduces a method that allows you to fine-tune black box embedding models (e.g. those vectors obtained with ChatGPT API). It shows there is around 10% improvement in various domains. Any feedbacks are welcome.
38.
▲
Fine-Tune Black Box Embedding Models
(arxiv.org)
10 points
by
mingtianzhang
1y ago
|
1 comments
39.
▲
by
mingtianzhang
1y ago
Check out this MCP: https://pageindex.ai/mcp , which allows you to chat with any long PDFs (hundreds of pages) beyond the context limit of Claude or ChatGPT.
40.
▲
Show HN: An MCP that allows you break LLM's context limit
(github.com)
5 points
by
mingtianzhang
1y ago
|
0 comments
41.
▲
Show HN: Read Pattern Matching and Machine Learning (PRML) on Claude [pdf]
(microsoft.com)
4 points
by
mingtianzhang
1y ago
|
0 comments
42.
▲
by
mingtianzhang
1y ago
The word index originally came from how humans retrieve information: book indexes and tables of contents that guide us to the right place. Computers later borrowed the term for data structures such as B-trees, hash tables, and more recently
43.
▲
Show HN: PageIndex MCP – Chat with Long PDFs on Claude or Cursor
(github.com)
4 points
by
mingtianzhang
1y ago
|
0 comments
44.
▲
Show HN: PageIndex MCP – Chat with Long PDFs on Claude or Cursor
(pageindex.ai)
1 points
by
mingtianzhang
1y ago
|
0 comments
45.
▲
by
mingtianzhang
1y ago
Hi, we generate a table of contents (ToC) for each document, so LLM can use the ToC to navigate the long documents, which can bypass the context limit. You can checkout this notebook for a quick toturial about our method: https://
46.
▲
Show HN: Chat with Long PDFs on Cursor or Claude Desktop
(docs.pageindex.ai)
2 points
by
mingtianzhang
1y ago
|
3 comments
47.
▲
by
mingtianzhang
1y ago
I agree that we need stochasticity in a probabilistic system, but I also think it would be good to control it. For example, we need the stochasticity introduced at high temperatures since it is inherent to the model, but we don’t need stoch
48.
▲
Ask HN: What Are Your Prompt Framework Design Principles?
1 points
by
mingtianzhang
1y ago
|
0 comments
49.
▲
Voyager – An interactive video generation model with realtime 3D reconstruction
(github.com)
322 points
by
mingtianzhang
1y ago
|
225 comments
50.
▲
by
mingtianzhang
1y ago
What's your opinion on modeling the world? Some people think the world is 3D, so we need to model the 3D world. Some people think that since human perception is 2D, we can just model the 2D view rather than the underlying 3D world, sin
51.
▲
by
mingtianzhang
1y ago
I used to work on a idea that instead of modelling the whole world, you can build your own Solipsistic model: https://openreview.net/pdf?id=fPaGSuQRP1O
52.
▲
by
mingtianzhang
1y ago
Do you think if such a tool exists, will it benefit the community or not?
53.
▲
by
mingtianzhang
1y ago
"why would we want an LLM do something as inefficiently as a human?" -- That is a good point. Maybe we should rename artificial intelligence (AI) to super-artificial intelligence (SAI).
54.
▲
by
mingtianzhang
1y ago
Yeah exactly, you can always do that by using another model that doesn't have the watermark.
55.
▲
by
mingtianzhang
1y ago
Just similar in theorem style, I try to emphasise that no lossy representation is universally (i.e. for all downstream tasks) better than another.
56.
▲
by
mingtianzhang
1y ago
Based on my research experience and judgment, I have published several top-conference papers in both the detection and diffusion domain, but I haven’t explored the engineering/product side. I believe that if such a system hasn’t been i
57.
▲
by
mingtianzhang
1y ago
This is also called occam's razor principle.
58.
▲
by
mingtianzhang
1y ago
For other AI systems like recognition/classification models, they are lossy.
59.
▲
by
mingtianzhang
1y ago
I mean, all likelihood-based generative models can be used as lossless compressors (by using arithmetic coding). The likelihood of a generated text corresponds exactly to its minimal code length under the model in practice. Thus, all curren
60.
▲
by
mingtianzhang
1y ago
For images/video/audio, removing such a watermark is very simple. By adding noise to the generated image and then using an open-source diffusion model to denoise it, the watermark can be broken. Or in an autoregressive model, use
More ›