检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

261 篇 期刊文献
118 篇 会议
1 册 图书

馆藏范围

380 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

243 篇 工学
- 153 篇 计算机科学与技术...
- 127 篇 软件工程
- 67 篇 生物工程
- 45 篇 生物医学工程（可授...
- 41 篇 信息与通信工程
- 34 篇 控制科学与工程
- 24 篇 光学工程
- 21 篇 电气工程
- 14 篇 电子科学与技术（可...
- 13 篇 建筑学
- 13 篇 土木工程
- 13 篇 安全科学与工程
- 9 篇 力学（可授工学、理...
- 9 篇 机械工程
- 9 篇 仪器科学与技术
186 篇 理学
- 91 篇 数学
- 68 篇 生物学
- 54 篇 物理学
- 45 篇 统计学（可授理学、...
- 21 篇 系统科学
- 17 篇 化学
- 14 篇 地球物理学
63 篇 管理学
- 34 篇 图书情报与档案管...
- 29 篇 管理科学与工程(可...
- 13 篇 工商管理
36 篇 医学
- 32 篇 临床医学
- 23 篇 基础医学(可授医学...
- 13 篇 药学(可授医学、理...
- 12 篇 公共卫生与预防医...
8 篇 经济学
- 8 篇 应用经济学
7 篇 农学
6 篇 教育学
5 篇 法学
1 篇 文学

主题

16 篇 machine learning
15 篇 deep learning
13 篇 image segmentati...
12 篇 accuracy
8 篇 feature extracti...
8 篇 training
7 篇 contrastive lear...
6 篇 predictive model...
5 篇 semantic segment...
5 篇 galaxies
5 篇 generative adver...
5 篇 noise measuremen...
5 篇 noise
5 篇 graph neural net...
5 篇 semantics
5 篇 stochastic syste...
5 篇 diseases
4 篇 reinforcement le...
4 篇 data mining
4 篇 cosmology

机构

40 篇 center for data ...
37 篇 center for machi...
33 篇 munich center fo...
17 篇 munich center fo...
15 篇 beijing internat...
13 篇 munich data scie...
11 篇 peking universit...
11 篇 national biomedi...
10 篇 national enginee...
9 篇 school of mathem...
8 篇 mdsi – munich da...
8 篇 mcml – munich ce...
7 篇 munich data scie...
7 篇 national key lab...
7 篇 center for intel...
6 篇 machine learning...
6 篇 dortmund data sc...
6 篇 department of co...
6 篇 munich data scie...
6 篇 peking universit...

作者

19 篇 zhu xiao xiang
15 篇 schuller björn w...
13 篇 krahmer felix
12 篇 triantafyllopoul...
12 篇 wang liwei
11 篇 dong bin
10 篇 li zhang
10 篇 bin dong
10 篇 zhang li
8 篇 zifan chen
8 篇 chen zifan
8 篇 shi yilei
7 篇 jie zhao
7 篇 veselovska anna
7 篇 fornasier massim...
6 篇 li hongwei bran
6 篇 zhao jie
6 篇 linguraru marius...
6 篇 weinan e.
6 篇 björn w. schulle...

语言

294 篇 英文
83 篇 其他
1 篇 中文

检索条件"机构=Machine Learning Data Science Center"

共 380 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Expected Probabilistic Hierarchies 38

Expected Probabilistic Hierarchies

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Kollovieh, Marcel Charpentier, Bertrand Zügner, Daniel Günnemann, Stephan School of Computation Information and Technology Technical University of Munich Germany Munich Data Science Institute Germany Munich Center for Machine Learning Germany Pruna AI Germany Microsoft Research AI for Science United States

Hierarchical clustering has usually been addressed by discrete optimization using heuristics or continuous optimization of relaxed scores for hierarchies. In this work, we propose to optimize expected scores under a probabilistic model over hierarchies. (1) We show theoretically that the global optimal values of the expected Dasgupta cost and Tree-Sampling divergence (TSD), two unsupervised metrics for hierarchical clustering, are equal to the optimal values of their discrete counterparts contrary to some relaxed scores. (2) We propose Expected Probabilistic Hierarchies (EPH), a probabilistic model to learn hierarchies in data by optimizing expected scores. EPH uses differentiable hierarchy sampling enabling end-to-end gradient descent based optimization, and an unbiased subgraph sampling approach to scale to large datasets. (3) We evaluate EPH on synthetic and real-world datasets including vector and graph datasets. EPH outperforms all other approaches quantitatively and provides meaningful hierarchies in qualitative evaluations. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving Generalization and Convergence by Enhancing Implicit Regularization 38

Improving Generalization and Convergence by Enhancing Implic...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Mingze Wang, Jinbo He, Haotian Wang, Zilin Huang, Guanhua Xiong, Feiyu Li, Zhiyu Weinan, E. Wu, Lei School of Mathematical Sciences Peking University China Center for Machine Learning Research Peking University China China AI for Science Institute China School of Data Science University of Science and Technology of China China ByteDance Research China

In this work, we propose an Implicit Regularization Enhancement (IRE) framework to accelerate the discovery of flat solutions in deep learning, thereby improving generalization and convergence. Specifically, IRE decouples the dynamics of flat and sharp directions, which boosts the sharpness reduction along flat directions while maintaining the training stability in sharp directions. We show that IRE can be practically incorporated with generic base optimizers without introducing significant computational overload. Experiments show that IRE consistently improves the generalization performance for image classification tasks across a variety of benchmark datasets (CIFAR-10/100, ImageNet) and models (ResNets and ViTs). Surprisingly, IRE also achieves a 2× speed-up compared to AdamW in the pre-training of Llama models (of sizes ranging from 60M to 229M) on datasets including Wikitext-103, Minipile, and Openwebtext. Moreover, we provide theoretical guarantees, showing that IRE can substantially accelerate the convergence towards flat minima in sharpness-aware minimization (SAM). © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal bounds for p sensitivity sampling via 2 augmentation 41

Optimal bounds for p sensitivity sampling via 2 augmentation

引用

41st International Conference on machine learning, ICML 2024

作者： Munteanu, Alexander Omlor, Simon Dortmund Data Science Center Faculties of Statistics and Computer Science TU Dortmund University Dortmund Germany Faculty of Statistics TU Dortmund University Dortmund Germany Lamarr-Institute for Machine Learning and Artificial Intelligence Dortmund Germany

data subsampling is one of the most natural methods to approximate a massively large data set by a small representative proxy. In particular, sensitivity sampling received a lot of attention, which samples points proportional to an individual importance measure called sensitivity. This framework reduces in very general settings the size of data to roughly the VC dimension d times the total sensitivity S while providing strong (1 ± Ε) guarantees on the quality of approximation. The recent work of Woodruff & Yasuda (2023c) improved substantially over the general Õ(Ε−2Sd) bound for the important problem of p subspace embeddings to Õ(Ε−2S2/p) for p ∈ [1, 2]. Their result was subsumed by an earlier Õ(Ε−2Sd1−p/2) bound which was implicitly given in the work of Chen & Derezinski (2021). We show that their result is tight when sampling according to plain p sensitivities. We observe that by augmenting the p sensitivities by 2 sensitivities, we obtain better bounds improving over the aforementioned results to optimal linear Õ(Ε−2(S+d)) = Õ(Ε−2d) sampling complexity for all p ∈ [1, 2]. In particular, this resolves an open question of Woodruff & Yasuda (2023c) in the affirmative for p ∈ [1, 2] and brings sensitivity subsampling into the regime that was previously only known to be possible using Lewis weights (Cohen & Peng, 2015). As an application of our main result, we also obtain an Õ(Ε−2µd) sensitivity sampling bound for logistic regression, where µ is a natural complexity measure for this problem. This improves over the previous Õ(Ε−2µ2d) bound of Mai et al. (2021) which was based on Lewis weights subsampling. Copyright 2024 by the author(s)

关键词： Importance sampling

来源：评论

学校读者我要写书评

暂无评论

Turnstile p leverage score sampling with applications 41

Turnstile p leverage score sampling with applications

引用

41st International Conference on machine learning, ICML 2024

The turnstile data stream model offers the most flexible framework where data can be manipulated dynamically, i.e., rows, columns, and even single entries of an input matrix can be added, deleted, or updated multiple times in a data stream. We develop a novel algorithm for sampling rows ai of a matrix A ∈ Rn×d, proportional to their p norm, when A is presented in a turnstile data stream. Our algorithm not only returns the set of sampled row indexes, it also returns slightly perturbed rows ãi ≈ ai, and approximates their sampling probabilities up to Ε relative error. When combined with preconditioning techniques, our algorithm extends to p leverage score sampling over turnstile data streams. With these properties in place, it allows us to simulate subsampling constructions of coresets for important regression problems to operate over turnstile data streams with very little overhead compared to their respective off-line subsampling algorithms. For logistic regression, our framework yields the first algorithm that achieves a (1 + Ε) approximation and works in a turnstile data stream using polynomial sketch/subsample size, improving over O(1) approximations, or exp(1/Ε) sketch size of previous work. We compare experimentally to plain oblivious sketching and plain leverage score sampling algorithms for p and logistic regression. Copyright 2024 by the author(s)

关键词： data streams

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Heterogeneous Ensemble Methods for Re-Identification 23

On the Effectiveness of Heterogeneous Ensemble Methods for R...

引用

23rd IEEE International Conference on machine learning and Applications, ICMLA 2024

作者： Klüttermann, Simon Rutinowski, Jérôme Polachowski, Frederik Nguyen, Anh Grimme, Britta Roidl, Moritz Müller, Emmanuel Paderborn University Paderborn Germany Tu Dortmund University Dortmund Germany Lamarr Institute for Machine Learning and Artificial Intelligence Dortmund Germany Research Center Trustworthy Data Science and Security Dortmund Germany

ISBN: (纸本)9798350374889

In this contribution, we introduce a novel ensemble method for the re-identification of industrial entities, using images of chipwood pallets and galvanized metal plates as dataset examples. Our algorithms replace commonly used, complex siamese neural networks with an ensemble of simplified, rudimentary models, providing wider applicability, especially in hardware-restricted scenarios. Each ensemble sub-model uses different types of extracted features of the given data as its input, allowing for the creation of effective ensembles in a fraction of the training duration needed for more complex state-of-the-art models. We reach state-of-the-art performance at our task, with a Rank-1 accuracy of over 77% and a Rank-10 accuracy of over 99%, and introduce five distinct feature extraction approaches, and study their combination using different ensemble methods. © 2024 IEEE.

关键词： Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

An Improved Finite-time Analysis of Temporal Difference learning with Deep Neural Networks 41

An Improved Finite-time Analysis of Temporal Difference Lear...

引用

41st International Conference on machine learning, ICML 2024

作者： Ke, Zhifa Wen, Zaiwen Zhang, Junyu Center for Data Science Peking University China Beijing International Center for Mathematical Research Center for Machine Learning Research Changsha Institute for Computing and Digital Economy Beijing China Department of Industrial Systems Engineering and Management National University of Singapore Singapore

Temporal difference (TD) learning algorithms with neural network function parameterization have well-established empirical success in many practical large-scale reinforcement learning tasks. However, theoretical understanding of these algorithms remains challenging due to the nonlinearity of the action-value approximation. In this paper, we develop an improved non-asymptotic analysis of the neural TD method with a general L-layer neural network. New proof techniques are developed and an improved new Õ(ϵ-1) sample complexity is derived. To our best knowledge, this is the first finite-time analysis of neural TD that achieves an Õ(ϵ-1) complexity under the Markovian sampling, as opposed to the best known Õ(ϵ-2) complexity in the existing literature. Copyright 2024 by the author(s)

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Can Gaussian Sketching Converge Faster on a Preconditioned Landscape? 41

Can Gaussian Sketching Converge Faster on a Preconditioned L...

引用

41st International Conference on machine learning, ICML 2024

作者： Wang, Yilong Ye, Haishan Dai, Guang Tsang, Ivor W. Center for Intelligent Decision-Making and Machine Learning School of Management Xi'an Jiaotong University China SGIT AI Lab State Grid Corporation of China China Singapore College of Computing and Data Science NTU Singapore

This paper focuses on the large-scale optimization which is very popular in the big data era. The gradient sketching is an important technique in the large-scale optimization. Specifically, the random coordinate descent algorithm is a kind of gradient sketching method with the random sampling matrix as the sketching matrix. In this paper, we propose a novel gradient sketching called GSGD (Gaussian Sketched Gradient Descent). Compared with the classical gradient sketching methods such as the random coordinate descent and SEGA (Hanzely et al., 2018), our GSGD does not require the importance sampling but can achieve a fast convergence rate matching the ones of these methods with importance sampling. Furthermore, if the objective function has a non-smooth regularization term, our GSGD can also exploit the implicit structure information of the regularization term to achieve a fast convergence rate. Finally, our experimental results substantiate the effectiveness and efficiency of our algorithm. Copyright 2024 by the author(s)

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Double Stochasticity Gazes Faster: Snap-Shot Decentralized Stochastic Gradient Tracking Methods 41

Double Stochasticity Gazes Faster: Snap-Shot Decentralized S...

引用

41st International Conference on machine learning, ICML 2024

作者： Di, Hao Ye, Haishan Chang, Xiangyu Dai, Guang Tsang, Ivor W. Center for Intelligent Decision-Making and Machine Learning School of Management Xi'an Jiaotong University China SGIT AI Lab State Grid Corporation of China China College of Computing and Data Science NTU Singapore Singapore

In decentralized optimization, m agents form a network and only communicate with their neighbors, which gives advantages in data ownership, privacy, and scalability. At the same time, decentralized stochastic gradient descent (SGD) methods, as popular decentralized algorithms for training large-scale machine learning models, have shown their superiority over centralized counterparts. Distributed stochastic gradient tracking (DSGT) (Pu & Nedić, 2021) has been recognized as the popular and state-of-the-art decentralized SGD method due to its proper theoretical guarantees. However, the theoretical analysis of DSGT (Koloskova et al., 2021) shows that its iteration complexity is (equation presented) where the doubly stochastic matrix W represents the network topology and CW is a parameter that depends on W. Thus, it indicates that the convergence property of DSGT is heavily affected by the topology of the communication network. To overcome the weakness of DSGT, we resort to the snapshot gradient tracking skill and propose two novel algorithms, snap-shot DSGT (SS DSGT) and accelerated snap-shot DSGT (ASS DSGT). We further justify that SS DSGT exhibits a lower iteration complexity compared to DSGT in the general communication network topology. Additionally, ASS DSGT matches DSGT's iteration complexity (equation presented) under the same conditions as DSGT. Numerical experiments validate SS DSGT's superior performance in the general communication network topology and exhibit better practical performance of ASS DSGT on the specified W compared to DSGT. Copyright 2024 by the author(s)

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Noisy Recovery in Unlimited Sampling via Adaptive Modulo Representations

Noisy Recovery in Unlimited Sampling via Adaptive Modulo Rep...

引用

2024 International Workshop on the Theory of Computational Sensing and its Applications to Radar, Multimodal Sensing and Imaging, CoSeRa 2024

作者： Patricio, Felipe Pagginelli Catala, Paul Krahmer, Felix Tu Munich Dept. of Mathematics Garching Germany Ibmi Helmholtz Munich Neuherberg Germany Institute Tu Munich Munich Center for Machine Learning Dept. of Mathematics&Munich Data Science Garching Germany

ISBN: (纸本)9798350365504

Recent works put forth the Unlimited Sensing Framework (USF), a novel approach to analog-to-digital conversion for high dynamic range sensing. It addresses the saturation phenomenon that commonly arises when physical measurements exceed the dynamic range of a sensor, yielding permanent loss of the input data. However, the USF still has some limitations when dealing with random noise. In the present paper, we propose a novel iterative method to tackle unlimited sensing in a noisy setting. In one step, our approach applies local transformations of the range to remove strong artifacts caused by the noise on local subdivisions of the domain. In the following step, the signal is then approximated via a least squares method. These two types of steps are then alternated. We illustrate the performances of our algorithm in high noise regime. © 2024 IEEE.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

The Challenges of the Nonlinear Regime for Physics-Informed Neural Networks 38

The Challenges of the Nonlinear Regime for Physics-Informed ...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Bonfanti, Andrea Bruno, Giuseppe Cipriani, Cristina BMW AG Basque Center for Applied Mathematics University of the Basque Country Digital Campus Munich Spain BMW AG Digital Campus Munich Germany Technical University of Munich Munich Center for Machine Learning Munich Data Science Institute Germany

The Neural Tangent Kernel (NTK) viewpoint is widely employed to analyze the training dynamics of overparameterized Physics-Informed Neural Networks (PINNs). However, unlike the case of linear Partial Differential Equations (PDEs), we show how the NTK perspective falls short in the nonlinear scenario. Specifically, we establish that the NTK yields a random matrix at initialization that is not constant during training, contrary to conventional belief. Another significant difference from the linear regime is that, even in the idealistic infinite-width limit, the Hessian does not vanish and hence it cannot be disregarded during training. This motivates the adoption of second-order optimization methods. We explore the convergence guarantees of such methods in both linear and nonlinear cases, addressing challenges such as spectral bias and slow convergence. Every theoretical result is supported by numerical examples with both linear and nonlinear PDEs, and we highlight the benefits of second-order methods in benchmark test cases. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共38页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：