积分充值
 首页
前端开发
AngularDartElectronFlutterHTML/CSSJavaScriptReactSvelteTypeScriptVue.js构建工具
后端开发
.NetC#C++C语言DenoffmpegGoIdrisJavaJuliaKotlinLeanMakefilenimNode.jsPascalPHPPythonRISC-VRubyRustSwiftUML其它语言区块链开发测试微服务敏捷开发架构设计汇编语言
数据库
Apache DorisApache HBaseCassandraClickHouseFirebirdGreenplumMongoDBMySQLPieCloudDBPostgreSQLRedisSQLSQLiteTiDBVitess数据库中间件数据库工具数据库设计
系统运维
AndroidDevOpshttpdJenkinsLinuxPrometheusTraefikZabbix存储网络与安全
云计算&大数据
Apache APISIXApache FlinkApache KarafApache KyuubiApache OzonedaprDockerHadoopHarborIstioKubernetesOpenShiftPandasrancherRocketMQServerlessService MeshVirtualBoxVMWare云原生CNCF机器学习边缘计算
综合其他
BlenderGIMPKiCadKritaWeblate产品与服务人工智能亿图数据可视化版本控制笔试面试
文库资料
前端
AngularAnt DesignBabelBootstrapChart.jsCSS3EchartsElectronHighchartsHTML/CSSHTML5JavaScriptJerryScriptJestReactSassTypeScriptVue前端工具小程序
后端
.NETApacheC/C++C#CMakeCrystalDartDenoDjangoDubboErlangFastifyFlaskGinGoGoFrameGuzzleIrisJavaJuliaLispLLVMLuaMatplotlibMicronautnimNode.jsPerlPHPPythonQtRPCRubyRustR语言ScalaShellVlangwasmYewZephirZig算法
移动端
AndroidAPP工具FlutterFramework7HarmonyHippyIoniciOSkotlinNativeObject-CPWAReactSwiftuni-appWeex
数据库
ApacheArangoDBCassandraClickHouseCouchDBCrateDBDB2DocumentDBDorisDragonflyDBEdgeDBetcdFirebirdGaussDBGraphGreenPlumHStreamDBHugeGraphimmudbIndexedDBInfluxDBIoTDBKey-ValueKitDBLevelDBM3DBMatrixOneMilvusMongoDBMySQLNavicatNebulaNewSQLNoSQLOceanBaseOpenTSDBOracleOrientDBPostgreSQLPrestoDBQuestDBRedisRocksDBSequoiaDBServerSkytableSQLSQLiteTiDBTiKVTimescaleDBYugabyteDB关系型数据库数据库数据库ORM数据库中间件数据库工具时序数据库
云计算&大数据
ActiveMQAerakiAgentAlluxioAntreaApacheApache APISIXAPISIXBFEBitBookKeeperChaosChoerodonCiliumCloudStackConsulDaprDataEaseDC/OSDockerDrillDruidElasticJobElasticSearchEnvoyErdaFlinkFluentGrafanaHadoopHarborHelmHudiInLongKafkaKnativeKongKubeCubeKubeEdgeKubeflowKubeOperatorKubernetesKubeSphereKubeVelaKumaKylinLibcloudLinkerdLonghornMeiliSearchMeshNacosNATSOKDOpenOpenEBSOpenKruiseOpenPitrixOpenSearchOpenStackOpenTracingOzonePaddlePaddlePolicyPulsarPyTorchRainbondRancherRediSearchScikit-learnServerlessShardingSphereShenYuSparkStormSupersetXuperChainZadig云原生CNCF人工智能区块链数据挖掘机器学习深度学习算法工程边缘计算
UI&美工&设计
BlenderKritaSketchUI设计
网络&系统&运维
AnsibleApacheAWKCeleryCephCI/CDCurveDevOpsGoCDHAProxyIstioJenkinsJumpServerLinuxMacNginxOpenRestyPrometheusServertraefikTrafficUnixWindowsZabbixZipkin安全防护系统内核网络运维监控
综合其它
文章资讯
 上传文档  发布文章  登录账户
IT文库
  • 综合
  • 文档
  • 文章

无数据

分类

全部云计算&大数据(21)机器学习(21)

语言

全部英语(13)中文(简体)(8)

格式

全部PDF文档 PDF(21)
 
本次搜索耗时 0.027 秒,为您找到相关结果约 21 个.
  • 全部
  • 云计算&大数据
  • 机器学习
  • 全部
  • 英语
  • 中文(简体)
  • 全部
  • PDF文档 PDF
  • 默认排序
  • 最新排序
  • 页数排序
  • 大小排序
  • 全部时间
  • 最近一天
  • 最近一周
  • 最近一个月
  • 最近三个月
  • 最近半年
  • 最近一年
  • pdf文档 《Efficient Deep Learning Book》[EDL] Chapter 3 - Learning Techniques

    quality and model footprint. An in-depth discussion of data augmentation and distillation follows right after. Following the lead from the previous chapters, the theory is complemented with programming Let’s take brightness transformation as an example. Figure 3-6 shows an image 2x bright (bottom-right corner) as compared to the original image (center). This transformation causes the whale fin to visually doubles the pixel intensity values leading to a brighter image. A 2X brightness transformation (bottom-right corner in figure 3-6) of our whale image flattens the water texture causing the pectoral fin to stand
    0 码力 | 56 页 | 18.93 MB | 1 年前
    3
  • pdf文档 《Efficient Deep Learning Book》[EDL] Chapter 6 - Advanced Learning Techniques - Technical Review

    to research and experiment with these and other similar ideas. With that being said, let’s jump right in. Self-Supervised Learning The vanilla supervised learning paradigm that we are familiar has two part. You can also play around with the arrangement of the input, and make the model predict the right order of the elements of . The next question is where do we get the data for creating these tasks but in other cases you might have to experiment and figure out the learning techniques and their right combinations that work well for your model training setup. With that being said, let’s jump to how
    0 码力 | 31 页 | 4.03 MB | 1 年前
    3
  • pdf文档 《Efficient Deep Learning Book》[EDL] Chapter 1 - Introduction

    set of tools and techniques that can help us make models pareto-optimal and let the user pick the right tradeoff. To that end, we can think of work on efficient deep learning to be categorized in roughly Figure 1-9: Illustration of the pruning process. On the left is the unpruned graph, and on the right is a pruned graph with the unimportant connections and neurons removed. Learning Techniques Learning data. The intuition is that the soft labels from the teacher can help the student capture how wrong/right the prediction is. For example, given an image of a truck if the student model predicts that it is
    0 码力 | 21 页 | 3.17 MB | 1 年前
    3
  • pdf文档 机器学习课程-温州大学-01机器学习-引言

    Python模块-Pandas ⚫ 数据合并 pd.merge(left, right) 类数 据库的数据融合操作. 参数:how,融合方式,包括左连接、右连接、内连 接(默认)和外连接;on,连接键;left_on,左 键;right_on,右键;left_index,是否将left 行索引作 为左键;right_index,是否将right行 索引作为右键. 66 Python模块-Pandas ⚫数据融合
    0 码力 | 78 页 | 3.69 MB | 1 年前
    3
  • pdf文档 《Efficient Deep Learning Book》[EDL] Chapter 4 - Efficient Architectures

    ‘cute’ occupies the x-axis, and the feature ‘dangerous’ occupies the y-axis. The animals on the bottom-right are cute and safe to play with. The dangerous animals occupy the top-left area of the plot. Note validation_data=(x_test_vectorized, y_test)) The model training without pre-trained embeddings follows right after: # Training without pre-trained embeddings. cnn_model_no_w2v = get_cnn_model(get_untrained_embedding_layer()) left shows a recurrent cell processing the input sequence element at time step t. The image on the right explains the processing of the entire input sequence across n time steps. RNNs are also used for
    0 码力 | 53 页 | 3.92 MB | 1 年前
    3
  • pdf文档 机器学习课程-温州大学-01深度学习-引言

    Python模块-Pandas ⚫ 数据合并 pd.merge(left, right) 类数 据库的数据融合操作. 参数:how,融合方式,包括左连接、右连接、内连 接(默认)和外连接;on,连接键;left_on,左 键;right_on,右键;left_index,是否将left 行索引作 为左键;right_index,是否将right行 索引作为右键. 67 Python模块-Pandas ⚫数据融合
    0 码力 | 80 页 | 5.38 MB | 1 年前
    3
  • pdf文档 《Efficient Deep Learning Book》[EDL] Chapter 7 - Automation

    on the left is smaller which was used to classify the cifar10 dataset. The larger network on the right is designed to learn from the ImageNet dataset. Both of these networks are largely composed of alternate predicted parameters is . In the original NASNet paper, the value for is chosen to be 5. Figure 7-8 (right) shows a predicted block. Figure 7-8: The structure of a block used to compose normal and reduction the timesteps predicting the hidden states, primitive operations and the combinations operations. Right image shows the structure of a block after applying the predictions from NASNet. NASNet selects the
    0 码力 | 33 页 | 2.48 MB | 1 年前
    3
  • pdf文档 《Efficient Deep Learning Book》[EDL] Chapter 2 - Compression Techniques

    to the idea of compression. Details of quantization and its applications in deep learning follow right after. The quantization section delves into the implementation details using code samples. We finish about the loss in quality. Figure 2-2: On the left is a high quality image of a cat. The cat on the right is a lower quality compressed image. Source Both the cat images in figure 2-2 might serve their uses 2-bits to represent each value. The quality degradation is apparent. The image in the bottom right corner (b=8) is the highest quality image. It’s hard to notice much difference for the b values 6
    0 码力 | 33 页 | 1.96 MB | 1 年前
    3
  • pdf文档 Lecture 5: Gaussian Discriminant Analysis, Naive Bayes

    2023 39 / 122 Multivariate Gaussian Distribution: A 2D Example From left to right: Σ = I, Σ = 0.6I, Σ = 2I From left to right: Σ = I, Σ = � 1 0.5 0.5 1 � , Σ = � 1 0.8 0.8 1 � Feng Li (SDU) GDA, NB and EM September 27, 2023 40 / 122 Multivariate Gaussian Distribution: A 2D Example From left to right: µ = � 1 0 � , µ = � −0.5 0 � , µ = � −1 −1.5 � Feng Li (SDU) GDA, NB and EM September 27, 2023 Q[t] i (z(i)) where Q[t] i (z(i)) = p(z(i) | x(i); θ[t]) θ[t+1] is then obtained by maximizing the right hand side of the above equation Feng Li (SDU) GDA, NB and EM September 27, 2023 100 / 122 Convergence
    0 码力 | 122 页 | 1.35 MB | 1 年前
    3
  • pdf文档 Keras: 基于 Python 的深度学习库

    (symmetric_height_crop, symmetric_width_crop)。 • 如果为 2 个整数的 2 个元组:解释为 ((top_crop, bottom_crop), (left_crop, right_crop))。 • data_format: 字符串,channels_last (默认) 或 channels_first 之一,表示输入中 维度的顺序。channels_last 对应输入尺寸为 symmetric_dim3_crop)。 • 如 果 为 2 个 整 数 的 3 个 元 组: 解 释 为 ((left_dim1_crop, right_dim1_crop), (left_dim2_crop, right_dim2_crop), (left_dim3_crop, right_dim3_crop))。 • data_format: 字符串,channels_last (默认) 或 channels_first • 如果为整数:在填充维度(第一个轴)的开始和结束处添加多少个零。 关于 KERAS 网络层 77 • 长度为 2 的整数元组:在填充维度的开始和结尾处添加多少个零 ((left_pad, right_pad))。 输入尺寸 3D 张量,尺寸为 (batch, axis_to_pad, features)。 输出尺寸 3D 张量,尺寸为 (batch, padded_axis, features)。
    0 码力 | 257 页 | 1.19 MB | 1 年前
    3
共 21 条
  • 1
  • 2
  • 3
前往
页
相关搜索词
EfficientDeepLearningBookEDLChapterTechniquesAdvancedTechnicalReviewIntroduction机器学习课程温州大学01引言Architectures深度AutomationCompressionLectureGaussianDiscriminantAnalysisNaiveBayesKeras基于Python
IT文库
关于我们 文库协议 联系我们 意见反馈 免责声明
本站文档数据由用户上传或本站整理自互联网,不以营利为目的,供所有人免费下载和学习使用。如侵犯您的权益,请联系我们进行删除。
IT文库 ©1024 - 2025 | 站点地图
Powered By MOREDOC AI v3.3.0-beta.70
  • 关注我们的公众号【刻舟求荐】,给您不一样的精彩
    关注我们的公众号【刻舟求荐】,给您不一样的精彩