<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Literature on The Personal Website of Myosotics</title>
    <link>/tags/literature/</link>
    <description>Recent content in Literature on The Personal Website of Myosotics</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-US</language>
    <lastBuildDate>Thu, 14 Dec 2023 00:00:00 +0000</lastBuildDate><atom:link href="/tags/literature/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>A variational approach to sparsity optimization based on Lagrange multiplier theorey</title>
      <link>/blog/2023-12-14-a-variational-approach-to-sparsity-optimization-based-on-lagrange-multiplier-theorey/</link>
      <pubDate>Thu, 14 Dec 2023 00:00:00 +0000</pubDate>
      
      <guid>/blog/2023-12-14-a-variational-approach-to-sparsity-optimization-based-on-lagrange-multiplier-theorey/</guid>
      <description>论文索引：Kong, X., Wang, X., &amp;amp; Zheng, W. (2023). Asymptotic distributions of a new type of design-based incomplete U-statistics. Stat, 12(1), e543.https://doi.org/10.1002/sta4.54
Orthogonal Array 定义：正交阵列 (Orthogonal Array) 是一类组合设计，设$A$是$L$元集$X$上的$m\times d$矩阵，若对任意$t(2≤t≤k)$列所构成的子矩阵，$X$上的每一个$t$元排列作为子矩阵的行各出现$λ$次，则称$A$为大小$m$，约束数$d$，水平数$L$，强度$t$和指数$λ$的正交阵列，在试验设计中称正交表，记为$OA(m,d,L,t)$，由定义有$m=λL^t$。 </description>
    </item>
    
    <item>
      <title>The PAC learning Framework</title>
      <link>/blog/2023-10-21-the-pac-learning-framework/</link>
      <pubDate>Sat, 21 Oct 2023 00:00:00 +0000</pubDate>
      
      <guid>/blog/2023-10-21-the-pac-learning-framework/</guid>
      <description>注意：此处主要参考书籍Foundations of Machine Learning
PAC, 即 Probably Approximately Correct 的缩写。PAC框架根据实现近似解所需的样本点 数量、样本复杂度以及学习算法的时间和空间复杂度来帮助定义可学习概念的类别，这取决 于 concept 的计算表示的成本。
The PAC learning model 基本符号：
$\mathcal{X}$：所有可能的 examples 或者 instances 的集合，也被称作 input space。
$\mathcal{y}$: 所有可能的 labels 或者 target values 的集合。此处方便计，讨论二 分类问题，即 $$\mathcal{y}=\{0,1\}.$$
concept $c: \mathcal{X} \rightarrow \mathcal{y}$，是从$\mathcal{X}$到$\mathcal{y}$的映射。考虑到所有映射结果为1的相应 的定义域，即$\mathcal{X}$的子集，可以唯一确定一个 concept, 故我们有时也可以用$\mathcal{X}$ 的子集来表示 concept。
concept class: 我们希望学习的 concept 的集合，记作$\mathcal{C}$。可以理解为所有 concept 的集合。
训练任务的抽象描述：
假设样本独立同分布来自于固定但未知的分布$\mathcal{D}$。机器学习问题陈述如下，考虑一些 concepts 的集合$\mathcal{H}$, 即 hypothesis set, 这些集合可能与$\mathcal{C}$ 不一致。给定一组来自分布$\mathcal{D}$的独立同分布样本$S=(x_1,\cdots, x_m)$， 其标签相应为$(c(x_1), \cdots, c(x_m))$，其中$c\in\mathcal{C}$为一个我们要去 学习的 concept。任务便是使用带有标签的样本$S$，从$\mathcal{H}$选取 generalization error 最小的 concept。</description>
    </item>
    
    <item>
      <title>A Review on Machine Learning Styles in Computer Vision-Techniques and Future Directions</title>
      <link>/blog/2023-10-10-a-review-of/</link>
      <pubDate>Tue, 10 Oct 2023 00:00:00 +0000</pubDate>
      
      <guid>/blog/2023-10-10-a-review-of/</guid>
      <description>摘要 英文原文 Computer applications have considerably shifted from single data processing to machine learning in recent years due to the accessibility and availability of massive volumes of data obtained through the internet and various sources. Machine learning is automating human assistance by training an algorithm on relevant data. Supervised, Unsupervised, and Reinforcement Learning are the three fundamental categories of machine learning techniques. In this paper, we have discussed the different learning styles used in the field of Computer vision, Deep Learning, Neural networks, and machine learning.</description>
    </item>
    
  </channel>
</rss>
