Roxanne

Unlocking the Secret Garden of AI Brains: Analyzing Claude 3.5 with Anthropic to See How AI Thinks

Unlocking the secret garden of the AI brain: analyzing Claude 3.5 through Anthropic, and seeing how AI thinks

After 2024, AI tools have penetrated into every corner of our lives. From small robots that automatically reply to messages on LINE to smart assistants used by companies to generate reports and write programs, AI seems to have become a part of our work and life. As a user of at least five different AI tools every day, I am often amazed at their fluency and intelligence. At some moments, I even feel that they understand me better than I understand myself!

But because of this, a sense of unease begins to emerge - do we really understand how these AIs reach their conclusions? Whenever I see AI complete an almost flawless report, a question inevitably arises in my mind: Does it truly understand these results, or is it just a coincidence?

If I were to use a picture to describe today's AI, it would probably be: it is like a strange plant that can grow on its own. We see it blooming beautiful flowers and bearing attractive fruits, but when we pick up a magnifying glass, we find that we have no idea how its roots, stems, and leaves interact with each other.

A study recently published by Anthropic is an attempt to open this black box. They used a nearly biologist-like approach to analyze the internal operating mechanisms of large language models such as Claude 3.5. Instead of just looking at inputs and outputs, we can observe cells and trace neurons, and try to answer the question: "What is each cell of this strange plant doing?"

If AI really enters sensitive fields such as medicine, law, and finance in the future, we cannot just look at the performance results, but must truly understand whether its reasoning process is reliable, safe, and controllable. Today, let’s explore how the AI brain works through Anthropic’s research!

Unlocking the secret garden of the AI brain: analyzing Claude 3.5 through Anthropic, and seeing how AI thinks Read More »

Technology Innovation Column, ,
Is “AI Agent” the next ChatGPT? This article will help you understand AI Agent!

 Is “AI Agent” the next ChatGPT? This article will help you understand AI Agent!

When you use ChatGPT for the first time, you may be surprised by its response speed, language capabilities, and amount of information. It is like an all-knowing and all-powerful online encyclopedia assistant that can write articles, modify resumes, generate marketing copy, and even write a piece of code. For many people, such tools are enough to change their work habits and lifestyle.
But if you are an entrepreneur, PM or freelancer, you will soon find that although ChatGPT can help you "make things", it cannot "complete the task". You have to direct every step yourself, as if you were working with a very smart but passive assistant. At this time, the concept of AI Agent emerged.
AI Agent is not a simple chatbot, but an intelligent system that can actively understand goals, plan task processes, and perform multi-step actions. You just need to tell it "I want to increase the conversion rate of the website", and it will automatically help you analyze website problems, make copywriting suggestions, perform A/B testing, and finally report the results. Such capabilities not only subvert our expectations of AI, but also mark the starting point for the next wave of AI revolution.
Today’s article will take you from the most basic definition to an in-depth understanding of what AI Agent is, what it can do, what are the representative tools and frameworks, and why it is the new trend that deserves your attention after ChatGPT. Let’s read on!

 Is “AI Agent” the next ChatGPT? This article will help you understand AI Agent! Read More »

Technology Innovation Column,
🤖 Do you dare to use AI employees? An internship experience starring Google Gemini

🤖 Do you dare to use AI employees? An internship experience starring Google Gemini

When a small or medium-sized enterprise begins to expand, the first problem it faces is usually not the market or product, but a lack of staff. Imagine that you are the person in charge of this company today. You may need to perform three duties: replying to customers, writing copy, and handling customer reviews at the same time.
And in the midst of these tedious but important tasks, you start hearing about a new helper that could change the way you do your job: Artificial Intelligence, or more specifically: Large Language Models (LLMs).

🤖 Do you dare to use AI employees? An internship experience starring Google Gemini Read More »

Technology Innovation Column,

[Leetcode] 1804. Implement Trie II

A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.

Implement the Trie class:

Trie() Initializes the trie object.
void insert(String word) Inserts the string word into the trie.
int countWordsEqualTo(String word) Returns the number of instances of the string word in the trie.
int countWordsStartingWith(String prefix) Returns the number of strings in the trie that have the string prefix as a prefix.
void erase(String word) Erases the string word from the trie.

[Leetcode] 1804. Implement Trie II Read More »

Leetcode, Technical Article

[LeetCode] 0020. Valid Parentheses

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Every close bracket has a corresponding open bracket of the same type.

[LeetCode] 0020. Valid Parentheses Read More »

Leetcode, Technical Article
When AI can write programs faster than you, how can engineers find their new position?

When AI can write programs faster than you, how can engineers find their new position?

Imagine this scenario: you sit in front of your computer and describe the function you have in mind. A few seconds later, artificial intelligence will generate a piece of executable code for you, or even the entire application will be born. Does it sound a bit magical?
This scenario is no longer a fantasy, but a reality that is happening now. In recent years, AI coding technology has risen rapidly, gradually transforming from a novel topic in technology news to an important tool for daily development work. From GitHub Copilot to DeepSeek R1, artificial intelligence has not only changed the way programming is done, but may also subvert the development direction of the entire software industry.
So to what extent has AI coding technology developed? Will it replace engineers' jobs? As people working in the technology industry, how should we face this wave of technological advancement? This article will gradually analyze in depth the origin, current status, practical applications, impact on the industry, future development, and how technology industry professionals should respond to AI coding.

When AI can write programs faster than you, how can engineers find their new position? Read More »

software engineer,

[Leetcode] 0211. Design Add and Search Words Data Structure

Design a data structure that supports adding new words and finding if a string matches any previously added string.

Implement the WordDictionary class:

WordDictionary() Initializes the object.
void addWord(word) Adds word to the data structure, it can be matched later.
bool search(word) Returns true if there is any string in the data structure that matches word or false otherwise. word may contain dots '.' where dots can be matched with any letter.

[Leetcode] 0211. Design Add and Search Words Data Structure Read More »

Leetcode, Technical Article

[Leetcode] 0208. Implement Trie

A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.

Implement the Trie class:

Trie() Initializes the trie object.
void insert(String word) Inserts the string word into the trie.
boolean search(String word) Returns true if the string word is in the trie (ie, was inserted before), and false otherwise.
boolean startsWith(String prefix) Returns true if there is a previously inserted string word that has the prefix prefix, and false otherwise.

[Leetcode] 0208. Implement Trie Read More »

Leetcode, Technical Article

[Leetcode] 0235. Lowest Common Ancestor of a Binary Search Tree

Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

[Leetcode] 0235. Lowest Common Ancestor of a Binary Search Tree Read More »

Leetcode, Technical Article