Can an AI learn what you like, rather than just what you've searched for?

Can an AI learn what you like, rather than just what you've searched for?

I'm a writer who was pondering the problems with getting my work discovered and realized that current search/recommendation engines don't go very deep. So I thought about ways to address this.

I was obviously mostly interested in books, so I worked on that first. I'd noticed LLMs are capable of pretty solid textual anaylsis these days, so I wondered if you could use that to generate good recommendations. So I sat down with an LLM- ChatGPT, Luna, for the curious- and spent about two hours explaining, in datail, my literary tastes- going into specifics like what sort of plot structure, characters, and humor I like, not just genre/specific titles.

The experiment demonstrated surprisingly strong results (though admittedly with a very small sample size)- the five recommendations I asked for were all ones that I hadn't heard of, as well as books that I would actually read. Further, I provided the LLM with a list of several books I had read and asked it to guess whether I would have liked them and why. The LLM successfully did so. Just proof of concept, but intriguing.

The problem with this, of course, is that most people wouldn't sit down with an LLM for an extended period of time to discuss literature. So I decided to build a small prototype of an app that might be able to do that.

The prototype is very simple- first, there are two types of information it saves- a persistent preference profile for the user, and user conversations. Then I built conversational functions to call an LLM to have conversations with the user to extract preference information.

The interesting thing to me is that this isn't just using an LLM to make recommendations- it's using one to analyze conversations over time, develop a persistent, evolving preference model for a specific user and then use that model to guide an LLM on a search for recommendations.

A few things occurred to me. First, the conversations and user profile DO NOT need to live on a central server- they can be stored locally by the user (or in a cloud of their choice).

Second, it seems like the user data could potentially be minimized and pseudonymized before being sent to the LLM, though I lack the technical expertise to know what is realistic here.

Third, if the LLM is conducting any searches, this would seem to make it possible to provide search services with less information about the user and their preferences (I'm not positive about this, so please do correct me if I'm wrong).

Finally, books are just one of the things you could use this for- it could technically be done for just about anything, at least in theory.

I experimented with this process several times, and received encouraging results.

What I don't know is-

Is this architecture novel? Does it work on things other than books? Am I an outlier in how well I articulate my preferences? Am I wrong about the potential benefits to privacy? Would people use this? If the search results are as qualitatively higher for others as it was for me, I think they probably would, but I just don't know.

The reason I'm posting this is because I am a writer, not a software engineer. I don't really have a strong interest in developing this and could bring very little to the table on the technical side. But it seems like a neat use of the more advanced LLMs we have these days. I don't really know if the idea is novel (not in each part- every bit of the pieces has been done before- but as a whole).

I'm in the process of documenting the prototype and experiments- I'd be curious to hear if I am completely barking up the wrong tree or if this could actually be a cool new way to conduct searches.

I'm not posting this as a business proposition- it's just not my jam. If anyone wants to take the idea and run with it, I'd love to see what you do with it.

Discussion 2 comments · 1 points · kartless · 6h
Open on HN
Loading the discussion…

Domain filters

Stories from these domains are hidden from every list. Subdomains match too: blocking substack.com also hides danluu.substack.com.

    New collection

    Delete this collection?

    About YAVCHN

    YAVCHN is a reader for Hacker News and Lobsters, with articles and discussions in separate windows or Classic pages.

    Created by Paul Parks and built with PUDL.

    YAVCHN source code on GitHub

    Privacy policy · Terms of use

    Help

    Keyboard

    j / k
    Move down and up the story list. The arrow keys scroll whatever has focus.
    Enter
    Read the marked story in the article reader.
    ]
    Read the next story in the same article-reader applet. Back returns to the previous story.
    p
    Pin or unpin the marked story, which keeps it in Pinned.
    n / N
    Move to the next or previous top-level comment in the window in front.
    c
    Collapse or expand that comment.
    f
    Hide or show the story list.
    Esc
    Close a menu or this help.
    Access key m
    Go to the menu bar. Most browsers take it with Alt on Windows and Linux, and Safari with Control and Option.
    ?
    Show this help.

    Windows

    Each story opens in a window holding its article above its discussion; drag the bar between them to share the room differently. A window can be moved by its title bar, resized from any edge, snapped to a half or a corner by dragging it there, maximised, or minimised to the bar at the foot of the page. Use Window > New reader window to open an empty reader, or Story > Open in new reader window to open another reader for the current article. Docked readers keep their articles when you select another story from the sidebar. Minimized readers can be restored and reused for their site. A window's Next story link reads on down the list in the same window.

    A link in a comment or an article to another Hacker News or Lobsters thread opens that thread in a window too. A link to a single HN comment opens the comment above its replies.

    While a story's window is in front, the Story and Discussion menus in the menu bar hold its commands: pinning, Next story, sorting, collapsing every thread, jumping to the first new comment. Each window also remembers where you were in its article and discussion, so a reload, or Back to a story that Next took you past, finds your place again. Closing a window forgets it.

    The whole arrangement lives in the address, so a bookmark or a shared link brings it back, and Back undoes the last change. Moving between Hacker News, Lobsters, their lists, Pinned and Find changes only the list, and leaves the windows open.

    The list

    The pin at the start of a row keeps the story in Pinned, and the cross at its end hides it. Pinned can be narrowed by words in the title, site or author, by source, and to the stories you haven't opened yet, and ordered by when you pinned them, by points or by comments; the filters are part of the address, so a filtered view can be bookmarked. Scroll past the end of the list to load more. Domain filters, in the View menu, hide every story from a site.

    Collections are named lists of stories. Story > Add to collection files the story in front into one or more of them, and the Collections feed shows them all or one at a time; the menu that chooses collections also creates, renames, and deletes them. A note is your own text on a story. Choose Add note in a story's toolbar to write one; it saves as you type. Rows with a note carry the note mark, and the Notes feed lists every noted story and searches the text of your notes.

    Browsing view

    View > Windowed and View > Classic select the browsing view and save your default in this browser. Window view reuses a reader for each feed. Classic view opens stories and applets as pages. Open as a page is a one-off action that does not change your saved default. Use the Windowed selector to return an article to a window. Direct page links always open as pages.

    Applets

    The Applets menu in the menu bar holds three tools, each a window of its own. Replies to me takes your Hacker News user name and lists the replies to your last thirty comments and stories, checking again every three minutes while it is open, and marking what is new since you last marked them read. Look up a user opens a profile on Hacker News or Lobsters, with their submissions and recent comments, as a commenter's name in any discussion does; the bar at the top of a profile looks up someone else in the same window, and Back returns to the one before. Who is hiring? filters the posts of HN's monthly hiring threads by the words you type.

    They read only what the sites publish to everyone, so none of them asks for a login, and your user name stays in this browser anonymously and is included in retained applet state when signed in.

    Find

    Find takes any link and lists every time it was submitted to Hacker News and Lobsters, so you can read each discussion of it.

    About

    YAVCHN never sees your Hacker News or Lobsters login. The discussion is fetched from each site's public API; to vote or reply, follow the link above the discussion, or the arrow beside a comment, to the source's own site. Without a YAVCHN account, your data stays in this browser. When signed in, pins, collections, notes, blocked domains, and retained reading state are stored with your account and synchronized across devices. Hidden stories and layout stay in this browser. The privacy policy has the details.

    Open source: github.com/paulmooreparks/yavchn. Built with PUDL.