"Please think for 3 minutes."

Soon, 3 minutes later, the host handed the microphone to Cai Kun.

"Next, please ask Student Cai to answer."

He blushed and stumbled for a long time: "I'm sorry, I haven't studied this field in depth... Recursive neural networks are artificial neural networks with tree-like hierarchical structures and network nodes recursively recursively the input information in their connection order. They are one of the deep learning algorithms."

After barely reciting some definitions, I was really confused. Student Cai said: "I'm sorry, I don't have a particularly good idea for the time being."

A boo came from below. Although Cai blushed, he still stood on the stage with his teeth.

He looked up at Zhang Yuan.

It depends on what you can answer. If you can't answer anything, why do you have much higher interview scores than me?

"Please ask your classmate Zhang to answer."

"I have a problem." Zhang Yuan raised his hand, "I have heard of hopfield network, but what is network stability?"

The questioner smiled: "If some weights of the network can converge to the equilibrium point, that is, the weights converge, then the output can also fit the expected output, that is, the system is stable. Therefore, the convergence is for variables, and the stability is for the system."

"The stability of the system cannot be guaranteed, the control system is unstable, and the convergence of the network has lost its foundation."

Zhang Yuan pondered it for a while and said, "I have not studied your research field in depth, but I have read some papers. But I have some simple ideas, you can listen to them."

"...First of all, it is a monotonic problem. In the hopfield network model of discrete time continuous states, whether the activation function of the neuron is a monotonic function, or whether it is locally monotonic."

"The second is to study the conditions when energy functions become convex functions, and consider the operation of the hopfield network as a constraint convex optimization problem to solve, so as to try to prove whether there are sufficient conditions for the globally unique minimum point..."

"Convex optimization, what you said is correct! Convex optimization is exactly where I am doing, I have another problem..."

This time, I talked about the heart of the questioner. He asked several questions about convex optimization and exchanged mathematics on the spot.

Finally, at the host's instructions, Zhang Yuan had to say: "If you need to know about convex optimization, you can ask me to discuss it with the queen of the station. I won't explain it in detail here..."

Many things are just based on their daily accumulation and talk nonsense. If he can really write a paper in a random way, he doesn’t have to go on stage and just be a “paper god”.

There was already a burst of applause below.

In such a short period of time, the right and wrong judgment is made.

Cai Kun wished he could find a crack on the ground and get into it.

He could only blush and secretly cheer himself up. Perhaps it was because of the difference caused by too few samples. He happened to encounter a question that he didn't know and the other party could know.

The host asked again: "No. 666, please tell your question."

The questioner was a girl, and her question was relatively pragmatic and not so erratic: "I want to ask a question about cache in the server."

"Caching is divided into two stages: one is the data placement stage, in the idle period when the data demand is small, use the spare communication resources to place data into each user's cache device. The other is the data distribution stage, assuming that during the peak data demand period, each user randomly requests a complete file from the server, and the server comprehensively considers these needs and distributes complete data to meet the needs of all users."

“My question is, how to design the cache scheme most scientifically?”

The questioner even sent a ppt to the screen.

This question is very professional, but everyone can understand what they are asking.

The host said: "Okay, please think for 3 minutes."

The microphone was handed to Zhang Yuan.

He smiled and said, "I think... I'd better give the opportunity to classmate Cai Kun first. I'm afraid that after I say it, he will say nothing."

The people below burst into laughter and whistles burst out.

Some believe it, and some don't.

Cai Kun was stunned. This time, he still had some ideas, but Zhang Yuan on the opposite side seemed to be unable to say anything and needed more time to think about it.

"...I have an idea that each user caches the m/n ratio of data of each file separately. During the data distribution stage, the server will distribute the data of each (1-m/n) missing part of each user one by one. At this time, the value of the transmitted data is r=k(1-m/n)..."

"I wonder if you have heard of a solution called 'Coding Cache', the specific algorithm is like this..."

"What you said makes sense."

Although he said this, the questioner was slightly disappointed. Coding cache can be said to be the most ordinary idea. It has already had mature algorithms and has no research significance. If you use this bad idea to start a project, you will probably be slapped back by the tutor.

Next, it was Zhang Yuan's turn, and he cleared his throat.

"Cai Kun has a good idea. During the distribution stage, he uses the relationship between existing cache information to design a certain encoding combination of required broadcast content, so that multiple users can decode the required part of the information from a single time at the same time, thereby obtaining global cache gain."

"But its limitation is that each file is divided into a parameter that increases exponentially with the number of users k. As we all know, exponential level division is difficult to achieve in algorithms..."

"Can I borrow your digital pen and the big screen?"

The host was stunned for a moment, "Yes."

Zhang Yuan drew a few pictures on the screen.

"…In essence, it is a combinatorial graph theory problem. What we want to get is a cache scheme when f is the polynomial level of k and r is the constant level. Or prove whether this scheme exists or not."

"Obviously, whether the file division can be converted into a polynomial level, i.e., to the level available in the industry, depends entirely on whether the hypergraph problem that satisfies certain characteristics can be constructed mathematically, which is like this..."

"I think after converting it to a math problem, I can already write a good paper. As for what the answer is, I definitely can't answer it now. It's just an idea. How to solve this graph theory problem needs to be thought about by this classmate himself."

There were whispers below.

There are still many professionals here who are talking nonsense. Naturally, they have their own distinction.

Slap sex!

A few minutes later, the questioner took the lead in applause.

There was a thunderous applause below.

Cai Kun no longer had the face to continue to stay. His face was flushed and he nodded in a hurry to admit defeat.

He finally knew that the test paper was also 100, and he scored 100 because of his strength, while others also scored 100 because there were only 100 on the paper.

"Old Cai, you have met a real pervert!"

"yes……"
Chapter completed!