zoukankan      html  css  js  c++  java
  • HDU 5734 Acperience(数学推导)

    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=(w1,w2,...,wn). Professor Zhang would like to find a binary vector B=(b1,b2,...,bn) (bi∈{+1,−1}) and a scaling factor α≥0 in such a manner that ∥W−αB∥2 is minimum.
    Note that ∥⋅∥ denotes the Euclidean norm (i.e. ∥X∥=√x12+⋯+xn2, where X=(x1,x2,...,xn)).
     
    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: w1,w2,...,wn (−10000≤wi≤10000).

    Output

    For each test case, output the minimum value of ∥W−αB∥2 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αB2的最小值,其中B=(b1,b2,...,bn) (bi∈{+1,−1}),α≥0

    题解

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

    min(∥w−αb2)=min(∑(wi2-2αbiwi2bi2))

    由于bi∈{+1,−1},易得bi*w≥0

    =min(∑(wi2-2α|wi|+α2))=min(∑(α2-2α|wi|+wi2))=min(nα2-2α∑|wi|+∑wi2)

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

    代入化简得=-(∑|wi|)2/n+∑wi2

    通分=(n∑wi2-(∑|wi|)2)/n

    gc=gcd(n∑wi2-(∑|wi|)2,n)

    所以p=(n∑wi2-(∑|wi|)2)/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 }
  • 相关阅读:
    QPS计算
    Burp学院-信息泄露
    Burp学院-OS命令注入
    Burp学院-SQL注入
    时间格式转换 日期转换
    K8s 1.20x版本nfs动态存储报错 persistentvolume-controller waiting for a volume to be created, either by external provisioner "qgg-nfs-storage" or manually created by system administrator
    K8Snode的自定义状态信息
    kubernetes之node资源紧缺时pod驱逐机制
    K8Snode最大pod数量
    阿里云域名白名单访问限制
  • 原文地址:https://www.cnblogs.com/taozi1115402474/p/9824355.html
Copyright © 2011-2022 走看看