HDU 5734 Acperience(数学推导)

Posted 2021-01-14 taozi1115402474

Problem Description

Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular type of DNN, known as Convolutional Neural Networks (CNN), have demonstrated state-of-the-art results in object recognition and detection.

Convolutional neural networks show reliable results on object recognition and detection that are useful in real world applications. Concurrent to the recent progress in recognition, interesting advancements have been happening in virtual reality (VR by Oculus), augmented reality (AR by HoloLens), and smart wearable devices. Putting these two pieces together, we argue that it is the right time to equip smart portable devices with the power of state-of-the-art recognition systems. However, CNN-based recognition systems need large amounts of memory and computational power. While they perform well on expensive, GPU-based machines, they are often unsuitable for smaller devices like cell phones and embedded electronics.

In order to simplify the networks, Professor Zhang tries to introduce simple, efficient, and accurate approximations to CNNs by binarizing the weights. Professor Zhang needs your help.

More specifically, you are given a weighted vector W=(w₁,w₂,...,w_n). Professor Zhang would like to find a binary vector B=(b₁,b₂,...,b_n) (b_i∈{+1,?1}) and a scaling factor α≥0 in such a manner that ∥W?αB∥² is minimum.

Note that ∥?∥ denotes the Euclidean norm (i.e. ∥X∥=√x₁²+?+x_n², where X=(x₁,x₂,...,x_n)).

 

Input

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:

The first line contains an integers n (1≤n≤100000) -- the length of the vector. The next line contains n integers: w₁,w₂,...,w_n (?10000≤w_i≤10000).

Output

For each test case, output the minimum value of ∥W?αB∥² as an irreducible fraction "p/q" where p, q are integers, q>0.

 

Sample Input

3
4
1 2 3 4
4
2 2 2 2
5
5 6 2 3 4

Sample Output

5/1
0/1
10/1

题意

给你一个n维向量w，求∥W?αB∥²的最小值，其中B=(b₁,b₂,...,b_n) (b_i∈{+1,?1})，α≥0

题解

开始误以为是平均数最小，WA了几次后开始推式子

min(∥w?αb∥²)=min(∑(w_i²-2αb_iw_i+α²b_i²))

由于b_i∈{+1,?1}，易得b_i*w≥0

=min(∑(w_i²-2α|w_i|+α²))=min(∑(α²-2α|w_i|+w_i²))=min(nα²-2α∑|w_i|+∑w_i²)

可知当α=∑|w_i|/n时函数取到min

代入化简得=-(∑|w_i|)²/n+∑w_i²

通分=(n∑w_i²-(∑|w_i|)²)/n

gc=gcd(n∑w_i²-(∑|w_i|)²,n)

所以p=(n∑w_i²-(∑|w_i|)²)/gc,q=n/gc

代码

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 
 4 #define ll long long
 5 const int maxn=1e5+5;
 6 int a[maxn];
 7 int main()
 8 {
 9     int t,n;
10     scanf("%d",&t);
11     while(t--)
12     {
13         scanf("%d",&n);
14         ll sum=0,ac=0;
15         for(int i=1;i<=n;i++)
16         {
17             scanf("%d",&a[i]);
18             sum+=abs(a[i]);
19             ac+=a[i]*1LL*a[i];
20         }
21         ll gc=__gcd(ac*n-sum*sum,1LL*n);
22         printf("%lld/%lld
",(ac*n-sum*sum)/gc,n/gc);
23     }
24     return 0;
25 }