SDSC6015 课程 3-更快的梯度下降与次梯度下降
#sdsc6015 English / 中文 回顾 点击展开 凸优化问题 凸优化问题的一般形式为: minx∈Rdf(x)\min_{x \in \mathbb{R}^d} f(x) x∈Rdminf(x) 其中 fff 是凸函数,Rd\mathbb{R}^dRd 是凸集,x∗x^*x∗ 是其最小化点: x∗=argminx∈Rdf(x)x^* = \arg\min_{x \in \mathbb{R}^d} f(x) x∗=argx∈Rdminf(x) 梯度下降(Gradient Descent, GD)的更新规则为: xk+1=xk−ηk+1∇f(xk)x_{k+1} = x_k - \eta_{k+1} \nabla f(x_k) xk+1=xk−ηk+1∇f(xk) xkx_kxk:当前参数点 ηk>0\eta_k > 0ηk>0:步长(学习率) xk+1x_{k+1}xk+1:更新后的参数点 平滑函数(Smooth Functions) 定义: 若函数 f:dom(f)→Rf: \text{dom}(f) \to...
SDSC6007 Course 2-Shortest Path Problems (SPP)
#sdsc6007 English / 中文 Shortest Path Problems (SPP) Problem Definition Given node set {1,2,…,N,t}\{1,2,\dots,N,t\}{1,2,…,N,t} (ttt=destination), aija_{ij}aij: Cost from node iii to jjj (aij=∞a_{ij} = \inftyaij=∞ if no direct path) Key assumption: All cycles have non-negative cost (∀ cycles i→j1→⋯→jk→i, total cost≥0\forall \text{ cycles } i \to j_1 \to \cdots \to j_k \to i,\ \text{total cost} \geq 0∀ cycles i→j1→⋯→jk→i, total cost≥0) Goal: Find min-cost path from any iii to ttt Sig...
SDSC6015 Course Information
#sdsc6015 #course information English / 中文 Course Overview Course Code: SDSC6015 Course Name: Stochastic Optimization for Machine Learning Semester: 2025-26, Semester A Instructor: Dr. Lu Yu Email: lu.yu@cityu.edu.hk Office: LAU 16-279 Lecture Time: Thursday 19:00 – 21:50 Lecture Location: CMC Building, M3017 Office Hours: To Be Announced (TBA) Teaching Assistants: Xinnian Yang (xinniyang2-c@my.cityu.edu.hk) Zhiyou Wu (zhiyouwu2-c@my.cityu.edu.hk) Assessment Scheme Component We...
作业清单
#作业清单 5001 暂无 5002 HW-1 (03/10/2025 23:30) Project Proposal (29/10/2025 23:30) 5003 Assignment 1 (03/10/2025 24:00) 注意:大学关于学术不端和抄袭(作弊)的政策在本课程中将受到高度重视。所有提交内容必须是您自己的写作或代码。您不得让其他学生复制您的作品。讨论作业是可以的,例如理解相关概念。本作业为个人作业。请将您的作品打包为一个名为 A1-XXXX-YYYY.zip 的压缩文件上传,其中 XXXX 是您的姓名,YYYY 是您的学号。请确保压缩文件中包含所有文件。 第一部分:ER建模(50分) 提交由绘图程序绘制的图表(可使用任何您喜欢的程序,例如来自 实体关系模型工具 的 ER 绘图工具),不接受手绘图。如果您对某些设计选择不确定,可以添加解释说明。将您的图表和可选解释上传到一个名为 pdf 的 PDF 文件中。 绘制一个单一的 ER 图来表示以下规格说明: 一家银行企业需要存储客户(由 cid 标识,属性包括 cname)和账户(由 ai...
SDSC6015 Course 3-Faster Gradient Descent and Subgradient Descent
#sdsc6015 English / 中文 Review Click to expand Convex Optimization Problems The general form of a convex optimization problem is: minx∈Rdf(x)\min_{x \in \mathbb{R}^d} f(x) x∈Rdminf(x) where fff is a convex function, Rd\mathbb{R}^dRd is a convex set, and x∗x^*x∗ is its minimizer: x∗=argminx∈Rdf(x)x^* = \arg\min_{x \in \mathbb{R}^d} f(x) x∗=argx∈Rdminf(x) The update rule for Gradient Descent (GD) is: xk+1=xk−ηk+1∇f(xk)x_{k+1} = x_k - \eta_{k+1} \nabla f(x_k) xk+1=xk−ηk+1∇f(xk) xkx_kx...
SDSC6012 课程 3-理论与实现
#sdsc6012 English / 中文 时间序列基础理论 时间序列定义与性质 时间序列是按时间顺序排列的随机变量序列,记为 {Xt:t∈T}\{X_t: t \in T\}{Xt:t∈T},其中 TTT 为时间索引集。在实际应用中,TTT 通常为离散集合(如 T={0,1,2,…}T = \{0, 1, 2, \ldots\}T={0,1,2,…})。 核心概念:时间序列分析旨在揭示序列内部的动态依赖关系,并基于历史数据建立预测模型。 示例数据表 1234567891011121314import pandas as pddata = { 'Date': ['2023-01-01', '2023-01-02', '2023-01-03', '2023-01-04', '2023-01-05', '2023-01-06', '2023-01-07', '2023...
SDSC6015 课程 2-梯度下降与次梯度下降方法
#sdsc6015 English / 中文 回顾 - 凸函数与凸优化 点击展开 凸函数定义 回顾 函数 f:Rd→Rf: \mathbb{R}^d \to \mathbb{R}f:Rd→R 是凸函数当且仅当: 定义域 dom(f)\text{dom}(f)dom(f) 是凸集; 对所有 x,y∈dom(f)\mathbf{x}, \mathbf{y} \in \text{dom}(f)x,y∈dom(f) 和 λ∈[0,1]\lambda \in [0,1]λ∈[0,1],满足: f(λx+(1−λ)y)≤λf(x)+(1−λ)f(y)f(\lambda \mathbf{x} + (1-\lambda)\mathbf{y}) \leq \lambda f(\mathbf{x}) + (1-\lambda)f(\mathbf{y}) f(λx+(1−λ)y)≤λf(x)+(1−λ)f(y) 几何意义:函数图像上任意两点间的线段位于图像上方。 一阶凸性判定 回顾 若 fff 可微,则凸性等价于: f(y)≥f(x)+∇f(x)⊤(y−x),∀x...
SDSC6015 Course 2-Gradient Descent Method and Subgradient Method
#sdsc6015 English / Chinese Review - Convex Functions and Convex Optimization Review Definition of Convex Functions Review A function f:Rd→Rf: \mathbb{R}^d \to \mathbb{R}f:Rd→R is convex if and only if: Its domain dom(f)\text{dom}(f)dom(f) is a convex set; For all x,y∈dom(f)\mathbf{x}, \mathbf{y} \in \text{dom}(f)x,y∈dom(f) and λ∈[0,1]\lambda \in [0,1]λ∈[0,1], it satisfies: f(λx+(1−λ)y)≤λf(x)+(1−λ)f(y)f(\lambda \mathbf{x} + (1-\lambda)\mathbf{y}) \leq \lambda f(\mathbf{x}) + (1-\lam...
总课表
.timetable-container * { box-sizing: border-box; margin: 0; padding: 0; } .timetable-container { font-family: 'Segoe UI', Tahoma, Geneva, Verdana, sans-serif; line-height: 1.6; color: #333; max-width: 100%; overflow-x: auto; } .timetable-controls { display: flex; justify-content: center; margin-bottom: 20px; ...
SDSC5001 Course 3-Overview of Statistical Machine Learning
#sdsc5001 English / 中文 Comparison of Terminology Between Statistics and Machine Learning Statistics Machine Learning Classification/RegressionClusteringClassification/Regression with missing responses(Nonlinear) Dimensionality Reduction Supervised LearningUnsupervised LearningSemi-supervised LearningManifold Learning Covariates/Response VariablesSample/PopulationStatistical ModelMisclassification/Prediction Error Features/OutcomeTraining Set/Test SetLearnerGeneralization Error Mul...
