JMLR workshop and conference proceedings最新文献

筛选
英文 中文
A Statistical Model for Event Sequence Data. 事件序列数据的统计模型。
Kevin Heins, Hal Stern
{"title":"A Statistical Model for Event Sequence Data.","authors":"Kevin Heins,&nbsp;Hal Stern","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>The identification of recurring patterns within a sequence of events is an important task in behavior research. In this paper, we consider a general probabilistic framework for identifying such patterns, by distinguishing between events that belong to a pattern and events that occur as part of background processes. The event processes, both for background events and events that are part of recurring patterns, are modeled as competing renewal processes. Using this framework, we develop an inference procedure to detect the sequences present in observed data. Our method is compared to a current approach used within the ethology literature on both simulated data and data collected to study the impact of fragmented and unpredictable maternal behavior on cognitive development of children.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":"33 ","pages":"338-346"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5397901/pdf/nihms846752.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34935416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Learning Heterogeneous Hidden Markov Random Fields. 学习异构隐马尔可夫随机场
Jie Liu, Chunming Zhang, Elizabeth Burnside, David Page
{"title":"Learning Heterogeneous Hidden Markov Random Fields.","authors":"Jie Liu, Chunming Zhang, Elizabeth Burnside, David Page","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Hidden Markov random fields (HMRFs) are conventionally assumed to be homogeneous in the sense that the potential functions are invariant across different sites. However in some biological applications, it is desirable to make HMRFs heterogeneous, especially when there exists some background knowledge about how the potential functions vary. We formally define heterogeneous HMRFs and propose an EM algorithm whose M-step combines a contrastive divergence learner with a kernel smoothing step to incorporate the background knowledge. Simulations show that our algorithm is effective for learning heterogeneous HMRFs and outperforms alternative binning methods. We learn a heterogeneous HMRF in a real-world study.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":"33 ","pages":"576-584"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4232933/pdf/nihms612861.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32821749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On A Nonlinear Generalization of Sparse Coding and Dictionary Learning. 论稀疏编码和字典学习的非线性泛化
Yuchen Xie, Jeffrey Ho, Baba Vemuri
{"title":"On A Nonlinear Generalization of Sparse Coding and Dictionary Learning.","authors":"Yuchen Xie, Jeffrey Ho, Baba Vemuri","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Existing dictionary learning algorithms are based on the assumption that the data are vectors in an Euclidean vector space ℝ <i><sup>d</sup></i> , and the dictionary is learned from the training data using the vector space structure of ℝ <i><sup>d</sup></i> and its Euclidean <b>L</b><sup>2</sup>-metric. However, in many applications, features and data often originated from a Riemannian manifold that does not support a global linear (vector space) structure. Furthermore, the extrinsic viewpoint of existing dictionary learning algorithms becomes inappropriate for modeling and incorporating the intrinsic geometry of the manifold that is potentially important and critical to the application. This paper proposes a novel framework for sparse coding and dictionary learning for data on a Riemannian manifold, and it shows that the existing sparse coding and dictionary learning methods can be considered as special (Euclidean) cases of the more general framework proposed here. We show that both the dictionary and sparse coding can be effectively computed for several important classes of Riemannian manifolds, and we validate the proposed method using two well-known classification problems in computer vision and medical imaging analysis.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":"28 3","pages":"1480-1488"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3796141/pdf/nihms509436.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"31811141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Estimation of Extreme Values and Associated Level Sets of a Regression Function via Selective Sampling. 通过选择性抽样估计回归函数的极值和相关水平集。
Stanislav Minsker
{"title":"Estimation of Extreme Values and Associated Level Sets of a Regression Function via Selective Sampling.","authors":"Stanislav Minsker","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>We propose a new method for estimating the locations and the value of an absolute maximum (minimum) of a function from the observations contaminated by random noise. Our goal is to solve the problem under minimal regularity and shape constraints. In particular, we do not assume differentiability of a function nor that its maximum is attained at a single point. We provide tight upper and lower bounds for the performance of proposed estimators. Our method is adaptive with respect to the unknown parameters of the problem over a large class of underlying distributions.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":" ","pages":"105-121"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3775669/pdf/nihms503983.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"31750844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mixed LICORS: A Nonparametric Algorithm for Predictive State Reconstruction. 混合LICORS:一种预测状态重建的非参数算法。
Georg M Goerg, Cosma Rohilla Shalizi
{"title":"Mixed LICORS: A Nonparametric Algorithm for Predictive State Reconstruction.","authors":"Georg M Goerg,&nbsp;Cosma Rohilla Shalizi","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>We introduce <i>mixed LICORS</i>, an algorithm for learning nonlinear, high-dimensional dynamics from spatio-temporal data, suitable for both prediction and simulation. Mixed LICORS extends the recent LICORS algorithm (Goerg and Shalizi, 2012) from hard clustering of predictive distributions to a non-parametric, EM-like soft clustering. This retains the asymptotic predictive optimality of LICORS, but, as we show in simulations, greatly improves out-of-sample forecasts with limited data. The new method is implemented in the publicly-available R package LICORS.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":"31 ","pages":"289-297"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4537072/pdf/nihms-697613.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"33995127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems. 非凸正则化优化问题的通用迭代收缩和阈值算法
Pinghua Gong, Changshui Zhang, Zhaosong Lu, Jianhua Z Huang, Jieping Ye
{"title":"A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.","authors":"Pinghua Gong, Changshui Zhang, Zhaosong Lu, Jianhua Z Huang, Jieping Ye","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Non-convex sparsity-inducing penalties have recently received considerable attentions in sparse learning. Recent theoretical investigations have demonstrated their superiority over the convex counterparts in several sparse learning settings. However, solving the non-convex optimization problems associated with non-convex penalties remains a big challenge. A commonly used approach is the Multi-Stage (MS) convex relaxation (or DC programming), which relaxes the original non-convex problem to a sequence of convex problems. This approach is usually not very practical for large-scale problems because its computational cost is a multiple of solving a single convex problem. In this paper, we propose a General Iterative Shrinkage and Thresholding (GIST) algorithm to solve the nonconvex optimization problem for a large class of non-convex penalties. The GIST algorithm iteratively solves a proximal operator problem, which in turn has a closed-form solution for many commonly used penalties. At each outer iteration of the algorithm, we use a line search initialized by the Barzilai-Borwein (BB) rule that allows finding an appropriate step size quickly. The paper also presents a detailed convergence analysis of the GIST algorithm. The efficiency of the proposed algorithm is demonstrated by extensive experiments on large-scale data sets.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":"28 2","pages":"37-45"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4184274/pdf/nihms497494.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32721681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Learning an Internal Dynamics Model from Control Demonstration. 从控制演示中学习内部动力学模型。
Matthew D Golub, Steven M Chase, Byron M Yu
{"title":"Learning an Internal Dynamics Model from Control Demonstration.","authors":"Matthew D Golub,&nbsp;Steven M Chase,&nbsp;Byron M Yu","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Much work in optimal control and inverse control has assumed that the controller has perfect knowledge of plant dynamics. However, if the controller is a human or animal subject, the subject's internal dynamics model may differ from the true plant dynamics. Here, we consider the problem of learning the subject's internal model from demonstrations of control and knowledge of task goals. Due to sensory feedback delay, the subject uses an internal model to generate an internal prediction of the current plant state, which may differ from the actual plant state. We develop a probabilistic framework and exact EM algorithm to jointly estimate the internal model, internal state trajectories, and feedback delay. We applied this framework to demonstrations by a nonhuman primate of brain-machine interface (BMI) control. We discovered that the subject's internal model deviated from the true BMI plant dynamics and provided significantly better explanation of the recorded neural control signals than did the true plant dynamics.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":" ","pages":"606-614"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3929129/pdf/nihms513644.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32147286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Factorized Diffusion Map Approximation. 分解扩散图近似。
Saeed Amizadeh, Hamed Valizadegan, Milos Hauskrecht
{"title":"Factorized Diffusion Map Approximation.","authors":"Saeed Amizadeh,&nbsp;Hamed Valizadegan,&nbsp;Milos Hauskrecht","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Diffusion maps are among the most powerful Machine Learning tools to analyze and work with complex high-dimensional datasets. Unfortunately, the estimation of these maps from a finite sample is known to suffer from the curse of dimensionality. Motivated by other machine learning models for which the existence of structure in the underlying distribution of data can reduce the complexity of estimation, we study and show how the factorization of the underlying distribution into independent subspaces can help us to estimate diffusion maps more accurately. Building upon this result, we propose and develop an algorithm that can automatically factorize a high dimensional data space in order to minimize the error of estimation of its diffusion map, even in the case when the underlying distribution is not decomposable. Experiments on both the synthetic and real-world datasets demonstrate improved estimation performance of our method over the standard diffusion-map framework.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":"2012 ","pages":"37-46"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4190137/pdf/nihms-408745.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32742671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fast, Exact Model Selection and Permutation Testing for ℓ2-Regularized Logistic Regression. 2-正则逻辑回归的快速、精确模型选择与置换检验。
Bryan Conroy, Paul Sajda
{"title":"Fast, Exact Model Selection and Permutation Testing for ℓ<sub>2</sub>-Regularized Logistic Regression.","authors":"Bryan Conroy,&nbsp;Paul Sajda","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Regularized logistic regression is a standard classification method used in statistics and machine learning. Unlike regularized least squares problems such as ridge regression, the parameter estimates cannot be computed in closed-form and instead must be estimated using an iterative technique. This paper addresses the computational problem of regularized logistic regression that is commonly encountered in model selection and classifier statistical significance testing, in which a large number of related logistic regression problems must be solved for. Our proposed approach solves the problems simultaneously through an iterative technique, which also garners computational efficiencies by leveraging the redundancies across the related problems. We demonstrate analytically that our method provides a substantial complexity reduction, which is further validated by our results on real-world datasets.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":"22 ","pages":"246-254"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3875235/pdf/nihms448097.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"31994014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
High-Dimensional Structured Feature Screening Using Binary Markov Random Fields. 基于二元马尔可夫随机场的高维结构化特征筛选。
Jie Liu, Peggy Peissig, Chunming Zhang, Elizabeth Burnside, Catherine McCarty, David Page
{"title":"High-Dimensional Structured Feature Screening Using Binary Markov Random Fields.","authors":"Jie Liu,&nbsp;Peggy Peissig,&nbsp;Chunming Zhang,&nbsp;Elizabeth Burnside,&nbsp;Catherine McCarty,&nbsp;David Page","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Feature screening is a useful feature selection approach for high-dimensional data when the goal is to identify <i>all</i> the features relevant to the response variable. However, common feature screening methods do not take into account the correlation structure of the covariate space. We propose the concept of a <i>feature relevance network</i>, a binary Markov random field to represent the relevance of each individual feature by potentials on the nodes, and represent the correlation structure by potentials on the edges. By performing inference on the feature relevance network, we can accordingly select relevant features. Our algorithm does not yield sparsity, which is different from the particular popular family of feature selection approaches based on penalized least squares or penalized pseudo-likelihood. We give one concrete algorithm under this framework and show its superior performance over common feature selection methods in terms of prediction error and recovery of the truly relevant features on real-world data and synthetic data.</p>","PeriodicalId":89793,"journal":{"name":"JMLR workshop and conference proceedings","volume":"22 ","pages":"712-721"},"PeriodicalIF":0.0,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3630518/pdf/nihms-455262.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"31467899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书