CS360 Machine Learning Final Competition

AI权益加码!Claude Code、Cursor等20+工具免费用! 购周边限时加赠Coding Plan Lite,畅享主流AI工具!学习进阶更高效! 阅读详情

CS360 Machine Learning Final Competition
Phase 1 Due: May 2 23:55, 2024
Competition Over: May 10 23:55, 2024
Phase 2 Due: May 13 23:55, 2024
April 23, 2024
General Instructions.
This homework is a Kaggle Competition: you will train neural nets using Pytorch on a given dataset,
and submit your results on the Kaggle competition website to get evaluated.
This is an individual assignment/competition, which means each student must hand in their own
answers, and you must write and use your own code in the programming parts of the assignment. It is
acceptable for you to collaborate in figuring out answers and to help each other solve the problems, and
you must list the names of students you discussed this with. We will assume that, as participants in an
undergraduate course, you will be taking the responsibility to make sure you personally understand the
solution to any work arising from such collaboration.
Your score will be mostly dependent on your model’s performance. You are also required to write a
short report (1-2 pages) to document what you have done to improve your model in the competition. We
recommend you type (or very neatly hand write) answers to the write-up part — for answers including figure
illustrations, you can draw by hand and take photos. You are welcome to use Latex, Microsoft Word, and
Google Doc, as long as the submitted format is pdf.
There are two phases of scoring. You only need to submit your Kaggle name for the first phase. You
get 10% of the total score of this final competition for the first phase, and you need to achieve
at least 50% accuracy on the leaderboard to get full credit. It is easy to achieve 50% accuracy. We
set the first phase to encourage you to start early.
For the second phase, please submit exactly two files: (1) a pdf file that is the report for your model;
and (2) a zip file which consists of your code as well as your model (the model refers to the trained model,
not the code for the model). The zip file can contain multiple code files. Please do not submit any
fewer or any more than these two files, the pdf and the zip files. Please make sure we can
run your code, and document any extra steps required (e.g., installation of certain libraries)
to run your code. If you are using ipython notebook, please keep all the generated logs. All
f
iles should be submitted to Brightspace (we don’t submit to gradescope this time). Neatness and clarity
count! If we can’t understand your report, or if your report is not consistent with your model/competition
performance, you will not receive full credit.
Also note you can NOT submit your predictions to the Kaggle competition after the dead
line. The system shuts down right at the deadline, and the best result from all your submissions
up to that point is used for evaluation. You have some extra days to finish your report and submit it
to brightspace.
1 Final Competition
TheKaggle competition is held at https://www.kaggle.com/t/e6112623017f4586bc3bd98e99b23087. You’ll
need to create a Kaggle account to participate in the competition. In your report, indicate your name
of your Kaggle account so we can map to your model’s performance.
1

  1. Datasets and Scripts: Download the datasets from the “Data” tab. There are three data files:
    (a) train mp3s.tar : a tarball file containing over 11k mp3 song snippets. Every snippet if of a length
    of 3 seconds.
    (b) train label.txt : the corresponding labels for the train mp3 files. The labels are of 4 categories:
    no voices in the snippet, one male-like voice in the snippet, one female-like voice in the snippet,
    and more than one person’s voice in the snippet.
    © test mp3s.tar : a tarball file containing over 3k mp3 song snippets for your model to make
    predictions. You will need to generate the labels and submit them to the Kaggle website to get
    scored.
    Weprovide an example submission.csv file with the submission file format. Your submission file should
    contain two columns, with column names (id, category), where “id” is the index of the data point
    (starting at 0) and “category” is your predicted class (also starting at 0). For example, a row of “3,2”
    indicates that your model predicts the fourth data point to be of class 2.
    Disclaimer: The song list is generated with ChatGPT, and we do not choose the distribution of male
    like vs. female-like voices. The course staff and some CS faculty (Prof. Wen and Prof. Tan) label the
    song snippets. There could be potential noises in labels due to human error or inconsistencies among
    different labelers. Also, when we label the snippets, we first remove the background music and only
    label the voices part. However, in the data we give you, we add back the background music without
    changing the labels.
  2. Data Preprocessing: You should design your own data preprocessing method. As a starting point, you
    may want to use librosa to process the mp3 file. Please include your data processing code in
    your code submission, and in the report describe how you preprocess the mp3 data.
  3. Models: You are free to use any machine learning model, and we recommend you use deep models. In
    your report, give an illustration of your best model structure. For example, use a flow
    chart to show that the input data first goes into a convolutional layer, followed by ReLU
    activation, then followed by … Also, report (an estimate of ) the number of hours you
    spend training your model and which GPU(s) you use. If you are not using deep models,
    provide similar information to illustrate your model design and training costs.
  4. Training: You should randomly select a portion (e.g., 3000 data points) of the training data we give you
    as the validation set to tune the hyper-parameters. I.e., you train the model on the rest 8k data points,
    and check the performance on the selected validation set. Then, you change the hyper-parameters and
    train again on the 8k data points. You repeat this process until you are happy with the validation set
    performance. At this point, it is optional and, in many cases, can get you some boosted performance
    that you train on the entire 11k data points in the train mp3s.tar using the best hyper-parameters you
    f
    ind, and then generate the predictions on the test mp3s.tar dataset. In your report, document
    your training procedure and discuss the hyper-parameters/optimization methods/data
    augmentation you have tried (if any). Data augmentation refers to the procedure of applying
    random distortions to the data without altering the labels. For example, you can add some echo effects
    to the music and the label should not change. Typically, you can get quite significant improvements
    by applying data augmentations.
  5. Submission: As stated above, you can follow the example submission file example submission.csv to
    create your own submission, and submit it under the “Submit Predictions” tab on the web page. Note
    that you are only allowed to make 5 submissions each day (to avoid manually over-fitting to the
    test dataset) and your best submission is used for your final score (you can also manually select the
    model to be scored).
  6. Evaluation: The evaluation metric for this competition is the test set accuracy, namely, the percentage
    of correct predictions divided by the total number of data points. We will release a baseline model
    performance based on how the entire class is doing. Exceeding the baseline model accuracy will score
    50% pts of the second phase scoring. The rest 50% pts will be scored based on your model’s
    2
    performance. Here’s the tentative scoring mechanism (we may change it depending on the overall
    performance of all submissions): The average accuracy (call it x∗) of the top 3 submissions will get
    100%. The baseline model accuracy (call it ¯ x) will get 50%. Denote your accuracy as x, and your score
    will be
    score(x) = min{max{50 ∗2( x−¯ x
    x∗−¯ x), 0}, 100}
    (1)
    The general idea is that getting higher accuracies typically requires an exponential increase in ef
    fort/computation. Here’s an example scoring, say ¯ x = 0.5, x∗ = 0.8, and x = 0.75, your score will be
    ≈89.08.
    We will give extra points for exceptional performance.
    Please note that the final report you submitted and your code are used to validate your model’s per
    formance. If you don’t include the information we have asked for or your results cannot be reproduced
    (we will not check for exact reproduction; a reasonably similar performance is good enough), we will
    apply some penalties to the final score.
  7. Rules: This is an individual assignment/competition and everyone has to train/submit a model, and
    your models should not be duplicates of each other.
    Your model should be a Pytroch model if you choose to use deep models.
    Don’t copy a pre-trained model online.
    Don’t manually label the test datasets. All predictions have to be made by a machine learning model.
    Don’t train on test!
  8. Helpful Materials:
    (a) Pytorch Convolutional Networks Tutorial on CIFAR-10: https://pytorch.org/tutorials/beginner/
    blitz/cifar10_tutorial.html.
    (b) You can use your own GPUs for this task. You can also use the Google Colab or the Kaggle
    platform, which offers free GPUs.
    Google Colab tutorial:
    https://colab.research.google.com/drive/16pBJQePbqkz3QFV54L4NIkOn1kwpuRrj.
    Kaggle notebook:
    https://www.kaggle.com/docs/efficient-gpu-usage.
    © Pytorch save and load models: https://pytorch.org/tutorials/beginner/saving_loading_
    models.html
    Pytorch optimizers (also pay attention to the learning rate schedulers): https://pytorch.org/
    docs/stable/optim.html
    Pytorch bathnorm layer: https://pytorch.org/docs/stable/generated/torch.nn.BatchNorm2d.
    html
    Pytorch data augmentation for image datahttps://pytorch.org/vision/stable/transforms.
    html
    Have Fun!
聚类在 RAG 里的落地细节 RAG 主检索一般还是向量相似度(ANN),聚类解决「向量分布混乱、上下文割裂、检索冗余、长文档分片语义漂移」问题。常见聚类算法:K-Means、DBSCAN、HDBSCAN、层次聚类;RAG 场景,K-Means 适合已知类数的场景。 阅读详情

相关推荐

AI-XGBoost机器学习与生态—植被与土地利用识别、土壤碳氮空间预测、生物多样性驱动机制、土壤微生物功能预测、生态退化与风险识

在众多机器学习方法中,XGBoost以其卓越的预测精度、对非线性和交互作用的天然刻画能力、对中小样本数据的良好适应性,以及SHAP等配套解释框架带来的机制解析能力,已成为生态、地学、环境、农业等领域高水平论文中应用最广泛的算法之一。课程不做概念宣讲,而是以真实研究流程为主线——从研究问题界定、多源数据整合、模型构建与调优、结果解释,到论文图表与文字表达——通过五类高频生态地学案例的完整实操,帮助学员把机器学习真正用进自己的课题中,形成可复现、可解释、可发表的研究成果。

weixin_xiao5kou4chang6kai4的博客 75

数学建模国赛倒计时 1 天 ——《机器学习精讲(决策树理论篇)》

决策树 = 一张流程图 + 一套规则。解释给评委听,用决策树;追求精度,用随机森林。两者不冲突,可以先用决策树解释变量关系,再用随机森林提高精度。

统计学小王子的博客 147

K-Means 聚类的目标函数:簇内误差平方和

K-Means 是一种无监督迭代式的聚类算法:给定数据集与预设簇数K,算法把样本划分为K个不相交的簇,使得同一簇内样本尽可能相似,不同簇间样本尽可能远离。核心思想:> “让簇内‘抱团’,让簇间‘疏远’。

Frost_Descent的博客 5010

统计学中的六大估计方法:从最大似然到核密度估计的本质理解

<think>我们只需要根据内容生成摘要,控制在150字以内。先理解文章主题:介绍统计学中六种估计方法(MLE、MAP、LSE、BLUE、贝叶斯估计、KDE)的核心思想、数学形式及区别。摘要需概括主要内容和本质。 写一个简短的摘要,不超过150字中文。先草稿: 本文介绍统计学中六种基本估计方法:最大似然估计、最大后验估计、最小二乘估计、最优线性无偏估计、贝叶斯估计和核密度估计。它们基于不同推断哲学:MLE只依赖数据最大化似然;MAP加入先验;LSE最小化误差平方;BLUE寻找线性无偏方差最小;贝叶斯估计输出

qq_51352578的博客 236

机器学习1导学:算法分类、建模流程、特征工程、模型拟合

找西瓜,

2401_87118211的博客 33

深入浅出TinyML 24:剪枝、聚类、蒸馏和算子替换是否真正适合MCU?

<think>我们只需要根据给定内容生成摘要,不超过150字。内容主要讲剪枝、聚类、蒸馏、算子替换在MCU部署中的实际收益取决于目标链支持,强调以Flash/RAM/延迟/能量等统一指标验收。需简洁概括核心观点。</think>剪枝、聚类、蒸馏和算子替换须经目标部署链才能转化为MCU收益。非结构化剪枝需稀疏内核支持;聚类常只优化压缩文件;蒸馏与算子替换更易直接减小模型结构。应用Flash、RAM、推理时间、能量和效果统一验收,压缩率仅为中间指标,避免误判。

337

72 量子比特跑真实道路图像,量子机器学习进入“硬仗”

72 量子比特的意义在于,量子机器学习的一道问题正在被改写。近日,量子软件与算法公司 BlueQubit 与本田在北美的前沿研发机构——本田美国研究院(Honda Research Institute USA)合作,把量子图像加载与分类实验推进到了此前少见的规模,部分模型在真实量子硬件上的测试准确率超过 90%。随着量子处理器继续增加量子比特数量、提高门保真度和连接能力,量子模型能否获得经典方法难以复制的表达能力,能否以更少的可训练参数完成某些任务,又能否形成不同的特征空间几何结构,当前仍然需要继续验证。

Qforepost的博客 404

机器学习笔记】

信息存在于数据的相对大小中的数据同时加上/减上/乘上/除去一个常量,信息不变数据预处理,没有改变信息本身,但是对后面模型的训练/收敛有帮助以0为中心,以1为标准差的数据。

2301_76821799的博客 170

机器学习谈起

本文以通俗易懂的方式介绍机器学习,通过“等人”故事引出其核心思想——基于数据归纳规律。文章系统阐述了机器学习的定义、方法(如回归、神经网络、SVM)、应用(如语音识别、图像处理)及与大数据、深度学习、人工智能的关系。强调机器学习是模拟人类经验归纳的过程,具有广泛前景,尤其在自动驾驶、推荐系统等领域表现突出。作者呼吁将高深技术落地于实际场景,推动技术普惠。

sheep404的博客 161

展望未来:利用【Python】结合【机器学习】强化数据处理能力

本文介绍了数据处理在机器学习项目中的重要性,重点讲解了使用Python库(如Pandas、NumPy、Scikit-

2601_96230101的博客 215

《模型不玄学》第19章 评估指标入门

模型好不好不是一个数能说完的。有的指标问"排名准不准",有的问"概率准不准",有的问"名单里有没有你想要的人"。这一章把常用指标逐个讲一遍,并说清楚为什么准确率在这里不能当主指标。

月华的博客 372

7大机器学习范式:有监督/自监督/半监督/主动学习/弱监督/自训练/迁移学习

深度学习与大模型面试中经常混淆各类机器学习学习范式,本文系统梳理**有监督、自监督、半监督、主动学习、弱监督、自训练、迁移学习**7 大核心范式,结合 NLP 任务 SFT、POS 词性标注、NER 命名实体识别讲解定义、特点与落地场景,辨析范式间边界、常见误区,串联完整 LLM 训练链路,适合算法面试复习与工程实践参考。

weixin_44021329的博客 682

机器学习≠逻辑推理!分清统计AI与符号AI

当下人工智能早已渗透生活方方面面,人脸识别、智能推荐、大语言模型、工业决策系统……各类AI应用百花齐放。但绝大多数人对AI的认知存在一个核心误区:默认所有人工智能都会“思考推理”,认为机器学习模型和人类一样,依靠逻辑、因果、规则做出判断。事实上,如今主流的机器学习、深度学习属于统计AI,核心是数据拟合与概率统计;而大众认知中“讲道理、有逻辑、可解释”的AI,是早期的符号AI,核心是人工规则与逻辑推理。二者是完全不同的AI范式,底层逻辑、运作机制、能力边界天差地别。

weixin_43156294的博客 500

冯‑克里斯映射估计算法逻辑

本文针对图像色彩校正中的冯-克里斯映射估计,比较了现有基于光照估计的方法,重点介绍一种通过颜色直方图匹配估计系数的算法。该算法无需显式计算光照,对几何畸变鲁棒,复杂度较低,并通过拟合直方图配对点求取对角映射,实验结果校正效果理想。

大熊 402

基于LangChain+LLM大模型+机器学习的恶意域名(流量)智能检测系统

【夯爆了!

2601_96229748的博客 154

数学建模国赛倒计时 1 天 ——《机器学习精讲(随机森林理论篇)》

随机森林 = 多棵树的民主投票。精度高、不解释、能告诉你谁最重要。国赛场景:解释用单棵树,精度用随机森林,两者完美互补。明天上考场,如果遇到以下问题,直接上随机森林:“有 30 个变量,不知道哪些重要?——随机森林给你排好序。“数据有噪声,单棵树不稳定?——随机森林帮你稳。“要预测精度高,解释性不强求?——随机森林最合适。

统计学小王子的博客 45

OpenCV计算机视觉开发入门与实践<三十六>:机器学习概述

机器学习是一门多领域交叉学科,是人工智能的核心研究领域。本文系统介绍了机器学习的基本概念、发展历程、研究现状、分类方法及常见算法。文章首先阐述了机器学习的定义与学科交叉特性,回顾了从17世纪贝叶斯理论到深度学习的发展历程,将其划分为四个阶段。随后分析了传统机器学习与大数据环境下机器学习的研究现状,并从学习策略、学习方法、学习方式、数据形式和学习目标五个维度对机器学习进行分类。最后介绍了决策树、朴素贝叶斯、支持向量机、随机森林、人工神经网络、Boosting与Bagging、关联规则、EM算法及深度学习等常见

欧特GO 245

推理链中的 Token 冗余与剪枝:消除无意义语气词对注意力权重的稀释

随着大模型深度推理(Reasoning Models)能力的演进,生成超长思维链(Long-CoT)已经成为解决复杂数学、符号规划与长代码生成的标准范式。然而,在审视模型输出的长达数千 Token 的推导轨迹时,我们经常会看到大量高度冗余的过渡性表达,例如:“”、“”、“这些口语化的语气词虽然在某种程度上模拟了人类的思考节奏,但从信息论与 Transformer 注意力计算的物理机理来看,。深入研究思维链中的 Token 冗余机理并进行动态剪枝,是实现极速低成本推理的关键。

2201_75984884的博客 1027

OpenCV计算机视觉开发入门与实践<三十七>:OpenCV中的机器学习

本文介绍 OpenCV 机器学习模块中的两类经典算法。第一部分讲解支持向量机(SVM)的原理,包括线性函数、核技巧等核心概念,并详细列出 OpenCV 4.10 中 `cv::ml::SVM` 类的常用函数与参数;第二部分介绍贝叶斯分类器的基本原理、常见类型(Naive Bayes、TAN、BAN、GBN)及分类流程。文中均配有完整的 C++ 示例代码,帮助读者快速上手实践。

欧特GO 943
上一篇: CS4386AIGameProgramming
下一篇: COMP9334 Project
todcode
博客等级 码龄7年 359粉丝 108原创
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值