#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2009

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Peter Richtárik, Martin Takác, Selin Damla Ahipasaoglu
- ArXiv
- 2012

Given a multivariate data set, sparse principal component analysis (SPCA) aims to extract several linear combinations of the variables that together explain the variance in the data as much as possible, while controlling the number of nonzero loadings in these combinations. In this paper we consider 8 different optimization formulations for computing a… (More)

- Vijay Krishnamurthy, Selin Damla Ahipaşaoğlu, Alexandre d’Aspremont
- 2009

Covariance selection seeks to estimate a covariance matrix by maximum likelihood while restricting the number of nonzero inverse covariance matrix coefficients. A single penalty parameter usually controls the tradeoff between log likelihood and sparsity in the inverse matrix. We describe an efficient algorithm for computing a full regularization path of… (More)

We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the quality of these relaxations by studying the approximation ratio of sparse eigenvalue relaxations. Our results are used to improve the performance of branch-and-bound algorithms… (More)

- Bo Chai, Alberto Costa, Selin Damla Ahipasaoglu, Shisheng Huang, Chau Yuen, Zaiyue Yang
- SmartGridComm
- 2014

- Selin Damla Ahipasaoglu
- Statistics and Computing
- 2015

We develop and analyse a first-order algorithm for the A-optimal experimental design problem. The problem is first presented as a special case of a parametric family of optimal design problems for which duality results and optimality conditions are given. Then, two first-order (Frank-Wolfe type) algorithms are presented, accompanied by a detailed… (More)

A popular discrete choice model that incorporates correlation information is the Multino-mial Probit (MNP) model where the random utilities of the alternatives are chosen from a multivariate normal distribution. Computing the choice probabilities is challenging in the MNP model when the number of alternatives is large and simulation is a popular technique… (More)

- Gülsah Karakaya, Stefano Galelli, Selin Damla Ahipasaoglu, Riccardo Taormina
- IEEE Trans. Cybernetics
- 2016

An emerging trend in feature selection is the development of two-objective algorithms that analyze the tradeoff between the number of features and the classification performance of the model built with these features. Since these two objectives are conflicting, a typical result stands in a set of Pareto-efficient subsets, each having a different cardinality… (More)

We propose a novel topic discovery algorithm for unlabeled images based on the bag-of-words (BoW) framework. We first extract a dictionary of visual words and subsequently for each image compute a visual word occurrence histogram. We view these histograms as rows of a large matrix from which we extract sparse principal components (PCs). Each PC identifies a… (More)

- Flora S. Tsai, Karthik Natarajan, +6 authors Thomas L. Magnanti
- EDUCON
- 2013