研究园简易版 · 经典书籍 · 期刊文章 · 有原文 · 完整版(可多选筛选、搜索) · 首页
2017 年的期刊文章 · 第 26 页
共 1233 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2017-01-04 到 2017。
按期刊、按主题看 →
JASA Latent Variables & Mixtures · 发表于 2017-01-04
Pietro Coretto, Christian Hennig
摘要
The two main topics of this article are the introduction of the “optimally tuned robust improper maximum likelihood estimator” (OTRIMLE) for robust clustering based on the multivariate Gaussian model for clusters, and a comprehensive simulation study comparing the OTRIMLE to maximum likelihood in Gaussian mixtures with and without noise component, mixtures of t-distributions, and the TCLUST approach for trimmed clustering. The OTRIMLE uses an improper constant density for modeling outliers and noise. This can be chosen optimally so that the nonnoise part of the data looks as close to a Gaussian mixture as possible. Some deviation from Gaussianity can be traded in for lowering the estimated noise proportion. Covariance matrix constraints and computation of the OTRIMLE are also treated. In the simulation study, all methods are confronted with setups in which their model assumptions are not exactly fulfilled, and to evaluate the experiments in a standardized way by misclassification rates, a new model-based definition of “true clusters” is introduced that deviates from the usual identification of mixture components with clusters. In the study, every method turns out to be superior for one or more setups, but the OTRIMLE achieves the most satisfactory overall performance. The methods are also applied to two real datasets, one without and one with known “true” clusters. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Clinical Trials · 发表于 2017-01-04
Guanhua Chen, Donglin Zeng, Michael R. Kosorok
摘要
In dose-finding clinical trials, it is becoming increasingly important to account for individual level heterogeneity while searching for optimal doses to ensure an optimal individualized dose rule (IDR) maximizes the expected beneficial clinical outcome for each individual. In this paper, we advocate a randomized trial design where candidate dose levels assigned to study subjects are randomly chosen from a continuous distribution within a safe range. To estimate the optimal IDR using such data, we propose an outcome weighted learning method based on a nonconvex loss function, which can be solved efficiently using a difference of convex functions algorithm. The consistency and convergence rate for the estimated IDR are derived, and its small-sample performance is evaluated via simulation studies. We demonstrate that the proposed method outperforms competing approaches. Finally, we illustrate this method using data from a cohort study for Warfarin (an anti-thrombotic drug) dosing. *(abstract via PubMed)*
JASA Longitudinal Data High-Dimensional · 发表于 2017-01-04
Degui Li, Junhui Qian, Liangjun Su
摘要
In this article, we consider estimation of common structural breaks in panel data models with unobservable interactive fixed effects. We introduce a penalized principal component (PPC) estimation procedure with an adaptive group fused LASSO to detect the multiple structural breaks in the models. Under some mild conditions, we show that with probability approaching one the proposed method can correctly determine the unknown number of breaks and consistently estimate the common break dates. Furthermore, we estimate the regression coefficients through the post-LASSO method and establish the asymptotic distribution theory for the resulting estimators. The developed methodology and theory are applicable to the case of dynamic panel data models. Simulation results demonstrate that the proposed method works well in finite samples with low false detection probability when there is no structural break and high probability of correctly estimating the break numbers when the structural breaks exist. We finally apply our method to study the environmental Kuznets curve for 74 countries over 40 years and detect two breaks in the data. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Longitudinal Data · 发表于 2017-01-04
Xinyu Zhang, Dalei Yu, Guohua Zou, Hua Liang
摘要
Considering model averaging estimation in generalized linear models, we propose a weight choice criterion based on the Kullback–Leibler (KL) loss with a penalty term. This criterion is different from that for continuous observations in principle, but reduces to the Mallows criterion in the situation. We prove that the corresponding model averaging estimator is asymptotically optimal under certain assumptions. We further extend our concern to the generalized linear mixed-effects model framework and establish associated theory. Numerical experiments illustrate that the proposed method is promising. *(abstract via OpenAlex)*
JASA Missing Data & Measurement Error Bayesian Methods Latent Variables & Mixtures · 发表于 2017-01-04
Jared S. Murray, Jerome P. Reiter
摘要
We present a nonparametric Bayesian joint model for multivariate continuous and categorical variables, with the intention of developing a flexible engine for multiple imputation of missing values. The model fuses Dirichlet process mixtures of multinomial distributions for categorical variables with Dirichlet process mixtures of multivariate normal distributions for continuous variables. We incorporate dependence between the continuous and categorical variables by (1) modeling the means of the normal distributions as component-specific functions of the categorical variables and (2) forming distinct mixture components for the categorical and continuous data with probabilities that are linked via a hierarchical model. This structure allows the model to capture complex dependencies between the categorical and continuous data with minimal tuning by the analyst. We apply the model to impute missing values due to item nonresponse in an evaluation of the redesign of the Survey of Income and Program Participation (SIPP). The goal is to compare estimates from a field test with the new design to estimates from selected individuals from a panel collected under the old design. We show that accounting for the missing data changes some conclusions about the comparability of the distributions in the two datasets. We also perform an extensive repeated sampling simulation using similar data from complete cases in an existing SIPP panel, comparing our proposed model to a default application of multiple imputation by chained equations. Imputations based on the proposed model tend to have better repeated sampling properties than the default application of chained equations in this realistic setting. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Other · 发表于 2017-01-04
Mark Fiecas, Hernando Ombao
摘要
We develop a new time series model to investigate the dynamic interactions between the nucleus accumbens and the hippocampus during an associative learning experiment. Preliminary analyses indicated that the spectral properties of the local field potentials at these two regions changed over the trials of the experiment. While many models already take into account nonstationarity within a single trial, the evolution of the dynamics across trials is often ignored. Our proposed model, the slowly evolving locally stationary process (SEv-LSP), is designed to capture nonstationarity both within a trial and across trials. We rigorously define the evolving evolutionary spectral density matrix, which we estimate using a two-stage procedure. In the first stage, we compute the within-trial time-localized periodogram matrix. In the second stage, we develop a data-driven approach that combines information from trial-specific local periodogram matrices. Through simulation studies, we show the utility of our proposed method for analyzing time series data with different evolutionary structures. Finally, we use the SEv-LSP model to demonstrate the evolving dynamics between the hippocampus and the nucleus accumbens during an associative learning experiment. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Spatial & Time Series · 发表于 2017-01-04
Ville A. Satopää, Robin Pemantle, Lyle H. Ungar
摘要
Randomness in scientific estimation is generally assumed to arise from unmeasured or uncontrolled factors. However, when combining subjective probability estimates, heterogeneity stemming from people’s cognitive or information diversity is often more important than measurement noise. This article presents a novel framework that uses partially overlapping information sources. A specific model is proposed within that framework and applied to the task of aggregating the probabilities given by a group of forecasters who predict whether an event will occur or not. Our model describes the distribution of information across forecasters in terms of easily interpretable parameters and shows how the optimal amount of extremizing of the average probability forecast (shifting it closer to its nearest extreme) varies as a function of the forecasters’ information overlap. Our model thus gives a more principled understanding of the historically ad hoc practice of extremizing average forecasts. Supplementary material for this article is available online. *(abstract via OpenAlex)*
JASA Other · 发表于 2017-01-04
Martin Lysy, Natesh S. Pillai, David B. Hill, M. Gregory Forest, John W. R. Mellnik, Paula A. Vasquez, Scott A. McKinley
摘要
State-of-the-art techniques in passive particle-tracking microscopy provide high-resolution path trajectories of diverse foreign particles in biological fluids. For particles on the order of 1 μm diameter, these paths are generally inconsistent with simple Brownian motion. Yet, despite an abundance of data confirming these findings and their wide-ranging scientific implications, stochastic modeling of the complex particle motion has received comparatively little attention. Even among posited models, there is virtually no literature on likelihood-based inference, model comparisons, and other quantitative assessments. In this article, we develop a rigorous and computationally efficient Bayesian methodology to address this gap. We analyze two of the most prevalent candidate models for 30-sec paths of 1 μm diameter tracer particles in human lung mucus: fractional Brownian motion (fBM) and a Generalized Langevin Equation (GLE) consistent with viscoelastic theory. Our model comparisons distinctly favor GLE over fBM, with the former describing the data remarkably well up to the timescales for which we have reliable information. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Causal Inference Missing Data & Measurement Error · 发表于 2017-01-04
J. R. Lockwood, Daniel F. McCaffrey
摘要
Matching estimators are commonly used to estimate causal effects in nonexperimental settings. Covariate measurement error can be problematic for matching estimators when observational treatment groups differ on latent quantities observed only through error-prone surrogates. We establish necessary and sufficient conditions for matching and weighting with functions of observed covariates to yield unconfounded causal effect estimators, generalizing results from the standard (i.e., no measurement error) case. We establish that in common covariate measurement error settings, including continuous variables with continuous measurement error, discrete variables with misclassification, and factor and item response theory models, no single function of the observed covariates computed for all units in a study is appropriate for matching. However, we demonstrate that in some circumstances, it is possible to create different functions of the observed covariates for treatment and control units to construct a variable appropriate for matching. We also demonstrate the counterintuitive result that in some settings, it is possible to selectively contaminate the covariates with additional measurement error to construct a variable appropriate for matching. We discuss the implications of our results for the choice between matching and weighting estimators with error-prone covariates. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Spatial & Time Series · 发表于 2017-01-04
Jörg Polzehl, Karsten Tabelow
摘要
Noise is a common issue for all magnetic resonance imaging (MRI) techniques such as diffusion MRI and obviously leads to variability of the estimates in any model describing the data. Increasing spatial resolution in MR experiments further diminishes the signal-to-noise ratio (SNR). However, with low SNR the expected signal deviates from the true value. Common modeling approaches therefore lead to a bias in estimated model parameters. Adjustments require an analysis of the data generating process and a characterization of the resulting distribution of the imaging data. We provide an adequate quasi-likelihood approach that employs these characteristics. We elaborate on the effects of typical data preprocessing and analyze the bias effects related to low SNR for the example of the diffusion tensor model in diffusion MRI. We then demonstrate the relevance of the problem using data from the Human Connectome Project. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Spatial & Time Series · 发表于 2017-01-04
Wolfgang Karl Härdle, Brenda López Cabrera, Ostap Okhrin, Weining Wang
摘要
On the temperature derivative market, modeling temperature volatility is an important issue for pricing and hedging. To apply the pricing tools of financial mathematics, one needs to isolate a Gaussian risk factor. A conventional model for temperature dynamics is a stochastic model with seasonality and intertemporal autocorrelation. Empirical work based on seasonality and autocorrelation correction reveals that the obtained residuals are heteroscedastic with a periodic pattern. The object of this research is to estimate this heteroscedastic function so that, after scale normalization, a pure standardized Gaussian variable appears. Earlier works investigated temperature risk in different locations and showed that neither parametric component functions nor a local linear smoother with constant smoothing parameter are flexible enough to generally describe the variance process well. Therefore, we consider a local adaptive modeling approach to find, at each time point, an optimal smoothing parameter to locally estimate the seasonality and volatility. Our approach provides a more flexible and accurate fitting procedure for localized temperature risk by achieving nearly normal risk factors. We also employ our model to forecast the temperaturein different cities and compare it to a model developed in 2005 by Campbell and Diebold. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Testing & Uncertainty · 发表于 2017-01-04
Pramita Bagchi, Moulinath Banerjee, Stilian A. Stoev
摘要
We introduce new point-wise confidence interval estimates for monotone functions observed with additive, dependent noise. Our methodology applies to both short- and long-range dependence regimes for the errors. The interval estimates are obtained via the method of inversion of certain discrepancy statistics. This approach avoids the estimation of nuisance parameters such as the derivative of the unknown function, which previous methods are forced to deal with. The resulting estimates are therefore more accurate, stable, and widely applicable in practice under minimal assumptions on the trend and error structure. The dependence of the errors especially long-range dependence leads to new phenomena, where new universal limits based on convex minorant functionals of drifted fractional Brownian motion emerge. Some extensions to uniform confidence bands are also developed. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Other · 发表于 2017-01-04
Edoardo M. Airoldi, Jonathan M. Bischof
摘要
An ongoing challenge in the analysis of document collections is how to summarize content in terms of a set of inferred themes that can be interpreted substantively in terms of topics. The current practice of parameterizing the themes in terms of most frequent words limits interpretability by ignoring the differential use of words across topics. Here, we show that words that are both frequent and exclusive to a theme are more effective at characterizing topical content, and we propose a regularization scheme that leads to better estimates of these quantities. We consider a supervised setting where professional editors have annotated documents to topic categories, organized into a tree, in which leaf-nodes correspond to more specific topics. Each document is annotated to multiple categories, at different levels of the tree. We introduce a hierarchical Poisson convolution model to analyze these annotated documents. A parallelized Hamiltonian Monte Carlo sampler allows the inference to scale to millions of documents. The model leverages the structure among categories defined by professional editors to infer a clear semantic description for each topic in terms of words that are both frequent and exclusive. In this supervised setting, we validate the efficacy of word frequency and exclusivity at characterizing topical content on two very large collections of documents, from Reuters and the New York Times. In an unsupervised setting, we then consider a simplified version of the model that shares the same regularization scheme with the previous model. We carry out a large randomized experiment on Amazon Mechanical Turk to demonstrate that topic summaries based on frequency and exclusivity, estimated using the proposed regularization scheme, are more interpretable than currently established frequency-based summaries, and that the proposed model produces more efficient estimates of exclusivity than the currently established models. *(abstract via OpenAlex)*
JASA Missing Data & Measurement Error Latent Variables & Mixtures · 发表于 2017-01-04
Wang Miao, Peng Ding, Zhi Geng
摘要
Missing data problems arise in many applied research studies. They may jeopardize statistical inference of the model of interest, if the missing mechanism is nonignorable, that is, the missing mechanism depends on the missing values themselves even conditional on the observed data. With a nonignorable missing mechanism, the model of interest is often not identifiable without imposing further assumptions. We find that even if the missing mechanism has a known parametric form, the model is not identifiable without specifying a parametric outcome distribution. Although it is fundamental for valid statistical inference, identifiability under nonignorable missing mechanisms is not established for many commonly used models. In this article, we first demonstrate identifiability of the normal distribution under monotone missing mechanisms. We then extend it to the normal mixture and t mixture models with nonmonotone missing mechanisms. We discover that models under the Logistic missing mechanism are less identifiable than those under the Probit missing mechanism. We give necessary and sufficient conditions for identifiability of models under the Logistic missing mechanism, which sometimes can be checked in real data analysis. We illustrate our methods using a series of simulations, and apply them to a real-life dataset. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA High-Dimensional Missing Data & Measurement Error Networks & Graphs · 发表于 2017-01-04
Yize Zhao, Matthias Chung, Brent A. Johnson, Carlos S. Moreno, Qi Long
摘要
Our work is motivated by a prostate cancer study aimed at identifying mRNA and miRNA biomarkers that are predictive of cancer recurrence after prostatectomy. It has been shown in the literature that incorporating known biological information on pathway memberships and interactions among biomarkers improves feature selection of high-dimensional biomarkers in relation to disease risk. Biological information is often represented by graphs or networks, in which biomarkers are represented by nodes and interactions among them are represented by edges; however, biological information is often not fully known. For example, the role of microRNAs (miRNAs) in regulating gene expression is not fully understood and the miRNA regulatory network is not fully established, in which case new strategies are needed for feature selection. To this end, we treat unknown biological information as missing data (i.e., missing edges in graphs), different from commonly encountered missing data problems where variable values are missing. We propose a new concept of imputing unknown biological information based on observed data and define the imputed information as the novel biological information. In addition, we propose a hierarchical group penalty to encourage sparsity and feature selection at both the pathway level and the within-pathway level, which, combined with the imputation step, allows for incorporation of known and novel biological information. While it is applicable to general regression settings, we develop and investigate the proposed approach in the context of semiparametric accelerated failure time models motivated by our data example. Data application and simulation studies show that incorporation of novel biological information improves performance in risk prediction and feature selection and the proposed penalty outperforms the extensions of several existing penalties. *(abstract via PubMed)*
JASA Functional Data · 发表于 2017-01-04
Naveen N. Narisetty, Vijayan N. Nair
摘要
We propose a new notion called “extremal depth” (ED) for functional data, discuss its properties, and compare its performance with existing concepts. The proposed notion is based on a measure of extreme “outlyingness.” ED has several desirable properties that are not shared by other notions and is especially well suited for obtaining central regions of functional data and function spaces. In particular: (a) the central region achieves the nominal (desired) simultaneous coverage probability; (b) there is a correspondence between ED-based (simultaneous) central regions and appropriate pointwise central regions; and (c) the method is resistant to certain classes of functional outliers. The article examines the performance of ED and compares it with other depth notions. Its usefulness is demonstrated through applications to constructing central regions, functional boxplots, outlier detection, and simultaneous confidence bands in regression problems. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Longitudinal Data · 发表于 2017-01-04
Claudio Agostinelli, Víctor J. Yohai
摘要
The classical Tukey–Huber contamination model (CCM) is a commonly adopted framework to describe the mechanism of outliers generation in robust statistics. Given a dataset with n observations and p variables, under the CCM, an outlier is a unit, even if only one or a few values are corrupted. Classical robust procedures were designed to cope with this type of outliers. Recently, a new mechanism of outlier generation was introduced, namely, the independent contamination model (ICM), where the occurrences that each cell of the data matrix is an outlier are independent events and have the same probability. ICM poses new challenges to robust statistics since the percentage of contaminated rows dramatically increase with p, often reaching more than 50% whereas classical affine equivariant robust procedures have a breakdown point of 50% at most. For ICM, we propose a new type of robust methods, namely, composite robust procedures that are inspired by the idea of composite likelihood, where low-dimension likelihood, very often the likelihood of pairs, are aggregated to obtain a tractable approximation of the full likelihood. Our composite robust procedures are built on pairs of observations to gain robustness in the ICM. We propose composite τ-estimators for linear mixed models. Composite τ-estimators are proved to have a high breakdown point both in the CCM and ICM. A Monte Carlo study shows that while classical S-estimators can only cope with outliers generated by the CCM, the estimators proposed here are resistant to both CCM and ICM outliers. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Other · 发表于 2017-01-04
Jessica Utts
摘要
Appreciating Statistics. I chose this title for my Presidential Address with a dual meaning in mind. The most obvious meaning, of course, is that what we do as statisticians should be appreciated, ... *(abstract via OpenAlex)*
JASA Bayesian Methods · 发表于 2017-01-04
Patrick R. Conrad, Youssef M. Marzouk, Natesh S. Pillai, Aaron Smith
摘要
We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
JASA Testing & Uncertainty · 发表于 2017-01-04
J. D. Godolphin
摘要
This article investigates the robustness of binary incomplete block designs against giving rise to a disconnected design in the event of observation loss. A link is established between the E-value of a planned design and the extent of observation loss that can be experienced while still guaranteeing an eventual design from which all treatment contrasts can be estimated. Patterns of missing observations covered include loss of entire blocks and loss of individual observations. Simple bounds are provided enabling practitioners to easily assess the robustness of a planned design. *(abstract via OpenAlex)*
Biometrika High-Dimensional · 发表于 2017-01-03
Yiyuan She
摘要
This paper studies simultaneous feature selection and extraction in supervised and unsupervised learning. We propose and investigate selective reduced rank regression for constructing optimal explanatory factors from a parsimonious subset of input features. The proposed estimators enjoy sharp oracle inequalities, and with a predictive information criterion for model selection, they adapt to unknown sparsity by controlling both rank and row support of the coefficient matrix. A class of algorithms is developed that can accommodate various convex and nonconvex sparsity-inducing penalties, and can be used for rank-constrained variable screening in high-dimensional multivariate data. The paper also showcases applications in macroeconomics and computer vision to demonstrate how low-dimensional data structures can be effectively captured by joint variable selection and projection. *(abstract via OpenAlex)*
Biometrika Survival Analysis Missing Data & Measurement Error · 发表于 2017-01-03
Aurelie Bertrand, Catherine Legrand, Raymond J. Carroll, Christophe de Meester, Ingrid Van Keilegom
摘要
In many situations in survival analysis, it may happen that a fraction of individuals will never experience the event of interest: they are considered to be cured. The promotion time cure model takes this into account. We consider the case where one or more explanatory variables in the model are subject to measurement error, which should be taken into account to avoid biased estimators. A general approach is the simulation-extrapolation algorithm, a method based on simulations which allows one to estimate the effect of measurement error on the bias of the estimators and to reduce this bias. We extend this approach to the promotion time cure model. We explain how the algorithm works, and we show that the proposed estimator is approximately consistent and asymptotically normally distributed, and that it performs well in finite samples. Finally, we analyse a database in cardiology: among the explanatory variables of interest is the ejection fraction, which is known to be measured with error. *(abstract via PubMed)*
Biometrika Survey & Sampling · 发表于 2017-01-03
L. Fattorini, M. Marcheselli, C. Pisani, L. Pratelli
摘要
We analyse design-based properties of two-phase strategies for estimating totals and nonlinear functions of totals for environmental populations when the sampling schemes are uniquely determined by points placed in the study region. In the first phase, points are located using tessellation stratified sampling, whereas in the second phase a finite population sampling scheme is adopted. We give sufficient conditions on second-phase designs that ensure consistency, and we investigate the variance convergence rate for some familiar schemes. *(abstract via OpenAlex)*
Biometrika Missing Data & Measurement Error Survey & Sampling Bayesian Methods · 发表于 2017-01-03
J. K. Kim, S. Yang
摘要
Multiple imputation is popular for handling item nonresponse in survey sampling. Current multiple imputation techniques with complex survey data assume that the sampling design is ignorable. In this paper, we propose a new multiple imputation procedure for parametric inference without this assumption. Instead of using the sample-data likelihood, we use the sampling distribution of the pseudo maximum likelihood estimator to derive the posterior distribution of the parameters. The asymptotic properties of the proposed method are investigated. A simulation study confirms that the new procedure provides unbiased point estimation and valid confidence intervals with correct coverage properties whether or not the sampling design is ignorable. *(abstract via OpenAlex)*
JMLR Bayesian Methods · 发表于 2017
Maximilian Schmitt, Björn Schuller
摘要
We introduce openXBOW, an open-source toolkit for the generation of bag-of-words (BoW) representations from multimodal input. In the BoW principle, word histograms were first used as features in document classification, but the idea was and can easily be adapted to, e.g., acoustic or visual descriptors, introducing a prior step of vector quantisation. The openXBOW toolkit supports arbitrary numeric input features and text input and concatenates computed sub-bags to a final bag. It provides a variety of extensions and options. To our knowledge, openXBOW is the first publicly available toolkit for the generation of crossmodal bags-of-words. The capabilities of the tool have been exemplified in different scenarios: sentiment analysis in tweets, classification of snore sounds, and time-dependent emotion recognition based on acoustic, linguistic, and visual information, where improved results over other feature representations were observed.
Econometrica Econometrics & Economics · 发表于 2017
Thomas Wiseman
摘要
I study repeated competition among oligopolists. The only novelty is that firms may go bankrupt and permanently exit: the probability that a firm survives a price war depends on its financial strength, which varies stochastically over time. Under some conditions including no entry, an anti-folk theorem holds: when firms are patient, so that strength levels change relatively quickly, every Nash equilibrium involves an immediate price war that lasts until at most one firm remains. Surprisingly, the possibility of entry may facilitate collusion, as may impatience. The model can explain some observed patterns of collusion and predation. *(abstract via OpenAlex)*
JMLR Other · 发表于 2017
Ardavan Saeedi, Tejas D. Kulkarni, Vikash K. Mansinghka, Samuel J. Gershman
摘要
Approximate inference in high-dimensional, discrete probabilistic models is a central problem in computational statistics and machine learning. This paper describes discrete particle variational inference (DPVI), a new approach that combines key strengths of Monte Carlo, variational and search- based techniques. DPVI is based on a novel family of particle- based variational approximations that can be fit using simple, fast, deterministic search techniques. Like Monte Carlo, DPVI can handle multiple modes, and yields exact results in a well- defined limit. Like unstructured mean-field, DPVI is based on optimizing a lower bound on the partition function; when this quantity is not of intrinsic interest, it facilitates convergence assessment and debugging. Like both Monte Carlo and combinatorial search, DPVI can take advantage of factorization, sequential structure, and custom search operators. This paper defines DPVI particle-based approximation family and partition function lower bounds, along with the sequential DPVI and local DPVI algorithm templates for optimizing them. DPVI is illustrated and evaluated via experiments on lattice Markov Random Fields, nonparametric Bayesian mixtures and block-models, and parametric as well as non-parametric hidden Markov models. Results include applications to real-world spike-sorting and relational modeling problems, and show that DPVI can offer appealing time/accuracy trade-offs as compared to multiple alternatives.
Econometrica Bayesian Methods · 发表于 2017
Marcin Pęski, Juuso Toikka
摘要
We consider the value of persistent information in strictly competitive situations, formalized as stochastic zero-sum games where only the maximizer ob-serves the state that evolves according to an ergodic Markov operator. We say that operator Q is better for the maximizer than operator P if the value of the game under Q is higher than under P regardless of the stage game. We show that this defines a partial order on the space of ergodic Markov operators, and provide a full characterization of this partial order. An i.i.d. state is the best case for the informed player; however, a perfectly persistent state is not necessarily the worst case. The analysis relies on a novel characterization of the value of a stochastic game with incomplete information. Our results can alternatively be interpreted as pertaining to the limit of the minmax value in repeated Bayesian games with Markov types. 1. *(abstract via OpenAlex)*
JMLR Other · 发表于 2017
Herbert Jaeger
摘要
Biological brains can learn, recognize, organize, and re- generate large repertoires of temporal patterns. Here I propose a mechanism of neurodynamical pattern learning and representation, called conceptors, which offers an integrated account of a number of such phenomena and functionalities. It becomes possible to store a large number of temporal patterns in a single recurrent neural network. In the recall process, stored patterns can be morphed and focussed. Parametric families of patterns can be learnt from a very small number of examples. Stored temporal patterns can be content- addressed in ways that are analog to recalling static patterns in Hopfield networks.
Econometrica High-Dimensional · 发表于 2017
Johannes Brumm, Simon Scheidegger
摘要
We present a flexible and scalable method for computing global solutions of high-dimensional stochastic dynamic models. Within a time iteration or value function iteration setup, we interpolate functions using an adaptive sparse grid algorithm. With increasing dimensions, sparse grids grow much more slowly than standard tensor product grids. Moreover, adaptivity adds a second layer of sparsity, as grid points are added only where they are most needed, for instance in regions with steep gradients or at non-differentiabilities. To further speed up the solution process, our implementation is fully hybrid parallel, combining distributed and shared memory parallelization paradigms, and thus permits an efficient use of high-performance computing architectures. To demonstrate the broad applicability of our method, we solve two very different types of dynamic models: first, high-dimensional international real business cycle models with capital adjustment costs and irreversible investment; second, multiproduct menu-cost models with temporary sales and economies of scope in price setting. *(abstract via OpenAlex)*
JMLR Other · 发表于 2017
Debarghya Ghoshdastidar, Ambedkar Dukkipati
摘要
In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs. The present paper continues the same line of study, where we focus on partitioning weighted uniform hypergraphs---a problem often encountered in computer vision. This work is motivated by two issues that arise when a hypergraph partitioning approach is used to tackle computer vision problems: (i) The uniform hypergraphs constructed for higher-order learning contain all edges, but most have negligible weights. Thus, the adjacency tensor is nearly sparse, and yet, not binary. (ii) A more serious concern is that standard partitioning algorithms need to compute all edge weights, which is computationally expensive for hypergraphs. This is usually resolved in practice by merging the clustering algorithm with a tensor sampling strategy---an approach that is yet to be analysed rigorously. We build on our earlier work on partitioning dense unweighted uniform hypergraphs (Ghoshdastidar and Dukkipati, ICML, 2015), and address the aforementioned issues by proposing provable and efficient partitioning algorithms. Our analysis justifies the empirical success of practical sampling techniques. We also complement our theoretical findings by elaborate empirical comparison of various hypergraph partitioning schemes.
Econometrica Other · 发表于 2017
Nathan H. Miller, Matthew C. Weinberg
摘要
We document abrupt increases in retail beer prices just after the consummation of the MillerCoors joint venture, both for MillerCoors and its major competitor, Anheuser‐Busch. Within the context of a differentiated‐products pricing model, we test and reject the hypothesis that the price increases can be explained by movement from one Nash–Bertrand equilibrium to another. Counterfactual simulations imply that prices after the joint venture are 6%–8% higher than they would have been with Nash–Bertrand competition, and that markups are 17%–18% higher. We relate the results to documentary evidence that the joint venture may have facilitated price coordination. *(abstract via OpenAlex)*
Econometrica Other · 发表于 2017
Edouard Schaal
摘要
This paper studies the impact of time-varying idiosyncratic risk at the establishment level on unemployment fluctuations over 1972-2009.I build a tractable directed search model with firm dynamics and time-varying idiosyncratic volatility.The model allows for endogenous separations, entry and exit, and job-to-job transitions.I show that the model can replicate salient features of the microeconomic behavior of firms and that the introduction of volatility improves the fit of the model for standard business cycle moments.In a series of counterfactual experiments, I show that time-varying risk is important to account for the magnitude of fluctuations in aggregate unemployment for past U.S. recessions.Though the model can account for about 40% of the total increase in unemployment for the 2007-2009 recession, uncertainty alone is not sufficient to explain the magnitude and persistence of unemployment during that episode. *(abstract via OpenAlex)*
Econometrica Econometrics & Economics · 发表于 2017
Susanto Basu, Brent Bundick
摘要
This paper examines the role of uncertainty shocks in a one-sector, representative-agent dynamic stochastic general equilibrium model. When prices are flexible, uncertainty shocks are not capable of producing business cycle co-movements among key macro variables. With countercyclical markups through sticky prices, however, uncertainty shocks can generate fluctuations that are consistent with business cycles. Monetary policy usually plays a key role in offsetting the negative impact of uncertainty shocks. If the central bank is constrained by the zero lower bound, then monetary policy can no longer perform its usual stabilizing function and higher uncertainty has even more negative effects on the economy. Calibrating the size of uncertainty shocks using fluctuations in the VIX, the authors find that increased uncertainty about the future may indeed have played a significant role in worsening the Great Recession, which is consistent with statements by policymakers, economists, and the financial press. *(abstract via OpenAlex)*
JMLR High-Dimensional · 发表于 2017
Mehmet Eren Ahsen, Niharika Challapalli, Mathukumalli Vidyasagar
摘要
In this paper we introduce a new optimization formulation for sparse regression and compressed sensing, called CLOT (Combined L-One and Two), wherein the regularizer is a convex combination of the $\ell_1$- and $\ell_2$-norms. This formulation differs from the Elastic Net (EN) formulation, in which the regularizer is a convex combination of the $\ell_1$- and $\ell_2$-norm squared. It is shown that, in the context of compressed sensing, the EN formulation does not achieve robust recovery of sparse vectors, whereas the new CLOT formulation achieves robust recovery. Also, like EN but unlike LASSO, the CLOT formulation achieves the grouping effect, wherein coefficients of highly correlated columns of the measurement (or design) matrix are assigned roughly comparable values. It is already known LASSO does not have the grouping effect. Therefore the CLOT formulation combines the best features of both LASSO (robust sparse recovery) and EN (grouping effect).
JMLR Nonparametric & Semiparametric · 发表于 2017
Samory Kpotufe, Nakul Verma
摘要
Kernel regression or classification (also referred to as weighted $\epsilon$-NN methods in Machine Learning) are appealing for their simplicity and therefore ubiquitous in data analysis. However, practical implementations of kernel regression or classification consist of quantizing or sub- sampling data for improving time efficiency, often at the cost of prediction quality. While such tradeoffs are necessary in practice, their statistical implications are generally not well understood, hence practical implementations come with few performance guarantees. In particular, it is unclear whether it is possible to maintain the statistical accuracy of kernel prediction---crucial in some applications---while improving prediction time.
JMLR Bayesian Methods · 发表于 2017
Alessio Benavoli, Giorgio Corani, Janez Demšar, Marco Zaffalon
摘要
The machine learning community adopted the use of null hypothesis significance testing (NHST) in order to ensure the statistical validity of results. Many scientific fields however realized the shortcomings of frequentist reasoning and in the most radical cases even banned its use in publications. We should do the same: just as we have embraced the Bayesian paradigm in the development of new machine learning methods, so we should also use it in the analysis of our own results. We argue for abandonment of NHST by exposing its fallacies and, more importantly, offer better---more sound and useful--- alternatives for it.
Econometrica Other · 发表于 2017
Monica Martinez-Bravo, Priya Mukherjee, Andreas Stegmann
摘要
Democracies widely differ in the extent to which powerful elites and interest groups retain influence over politics.While a large literature argues that elite capture is rooted in a country's history, our understanding of the determinants of elite persistence is limited.In this paper, we show that allowing old-regime agents to remain in office during democratic transitions is a key determinant of the extent of elite capture.We exploit quasi-random from Indonesia: Soeharto-regime mayors were allowed to finish their terms before being replaced by new leaders.Since mayors' political cycles were not synchronized, this event generated exogenous variation in how long old-regime mayors remained in their position during the democratic transition.Districts with longer exposure to old-regime mayors experience worse governance outcomes, higher elite persistence, and lower political competition in the medium run.The results suggest that slower transitions towards democracy allow the old-regime elites to capture democracy. *(abstract via OpenAlex)*
JMLR Other · 发表于 2017
Frans A. Oliehoek, Matthijs T. J. Spaan, Bas Terwijn, Philipp Robbel, João V. Messias
摘要
This article describes the Multiagent Decision Process (MADP) Toolbox, a software library to support planning and learning for intelligent agents and multiagent systems in uncertain environments. Key features are that it supports partially observable environments and stochastic transition models; has unified support for single- and multiagent systems; provides a large number of models for decision-theoretic decision making, including one-shot and sequential decision making under various assumptions of observability and cooperation, such as Dec-POMDPs and POSGs; provides tools and parsers to quickly prototype new problems; provides an extensive range of planning and learning algorithms for single- and multiagent systems; is released under the GNU GPL v3 license; and is written in C++ and designed to be extensible via the object-oriented paradigm.
JMLR Latent Variables & Mixtures · 发表于 2017
Alexander J. Gates, Yong-Yeol Ahn
摘要
Clustering is a central approach for unsupervised learning. After clustering is applied, the most fundamental analysis is to quantitatively compare clusterings. Such comparisons are crucial for the evaluation of clustering methods as well as other tasks such as consensus clustering. It is often argued that, in order to establish a baseline, clustering similarity should be assessed in the context of a random ensemble of clusterings. The prevailing assumption for the random clustering ensemble is the permutation model in which the number and sizes of clusters are fixed. However, this assumption does not necessarily hold in practice; for example, multiple runs of K-means clustering reurns clusterings with a fixed number of clusters, while the cluster size distribution varies greatly. Here, we derive corrected variants of two clustering similarity measures (the Rand index and Mutual Information) in the context of two random clustering ensembles in which the number and sizes of clusters vary. In addition, we study the impact of one-sided comparisons in the scenario with a reference clustering. The consequences of different random models are illustrated using synthetic examples, handwriting recognition, and gene expression data. We demonstrate that the choice of random model can have a drastic impact on the ranking of similar clustering pairs, and the evaluation of a clustering method with respect to a random baseline; thus, the choice of random clustering model should be carefully justified.