NVNuri Denizcan Vanli

Nuri Denizcan Vanli

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Nuri Denizcan Vanli has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs

    by Murat A. Erdogdu, Asuman Ozdaglar, Pablo A. Parrilo, Nuri Denizcan Vanli


  • Randomness and permutations in coordinate descent methods

    by Mert Gürbüzbalaban, Asuman Ozdaglar, Nuri Denizcan Vanli, Stephen J. Wright


  • Nonlinear regression via incremental decision trees

    by N. Denizcan Vanli, Muhammed O. Sayin, Mohammadreza Mohaghegh N., Huseyin Ozkan, Suleyman S. Kozat


  • Open Access

    Randomness and Permutations in Coordinate Descent Methods

    by Mert Gurbuzbalaban, Asuman Ozdaglar, Nuri Denizcan Vanli, Stephen J. Wright

    We consider coordinate descent (CD) methods with exact line search on convex quadratic problems. Our main focus is to study the performance of the CD method that use random permutations in each epoch and compare it to the performance of the CD methods that use deterministic orders and random sampling with replacement. We focus on a class of convex quadratic problems with a diagonally dominant Hessian matrix, for which we show that using random permutations instead of random with-replacement sampling improves the performance of the CD method in the worst-case. Furthermore, we prove that as the Hessian matrix becomes more diagonally dominant, the performance improvement attained by using random permutations increases. We also show that for this problem class, using any fixed deterministic order yields a superior performance than using random permutations. We present detailed theoretical analyses with respect to three different convergence criteria that are used in the literature and support our theoretical results with numerical experiments.

  • Open Access

    Stochastic Subgradient Algorithms for Strongly Convex Optimization Over Distributed Networks

    by Muhammed O. Sayin, N. Denizcan Vanli, Suleyman S. Kozat, Tamer Basar

    We study diffusion and consensus based optimization of a sum of unknown convex objective functions over distributed networks. The only access to these functions is through stochastic gradient oracles, each of which is only available at a different node; and a limited number of gradient oracle calls is allowed at each node. In this framework, we introduce a convex optimization algorithm based on stochastic subgradient descent (SSD) updates. We use a carefully designed time-dependent weighted averaging of the SSD iterates, which yields a convergence rate of $O\left(\frac{N\sqrt{N}}{(1-\sigma)T}\right)$ after $T$ gradient updates for each node on a network of $N$ nodes, where $0\leq \sigma <1$ denotes the second largest singular value of the communication matrix. This rate of convergence matches the performance lower bound up to constant terms. Similar to the SSD algorithm, the computational complexity of the proposed algorithm also scales linearly with the dimensionality of the data. Furthermore, the communication load of the proposed method is the same as the communication load of the SSD algorithm. Thus, the proposed algorithm is highly efficient in terms of complexity and communication load. We illustrate the merits of the algorithm with respect to the state-of-art methods over benchmark real life data sets.


  • Adaptive hierarchical space partitioning for online classification

    by O. Fatih Kilic, N. Denizcan Vanli, Huseyin Ozkan, Ibrahim Delibalta, Suleyman S. Kozat

    We propose an online algorithm for supervised learning with strong performance guarantees under the empirical zero-one loss. The proposed method adaptively partitions the feature space in a hierarchical manner and generates a powerful finite combination of basic models. This provides algorithm to obtain a strong classification method which enables it to create a linear piecewise classifier model that can work well under highly non-linear complex data. The introduced algorithm also have scalable computational complexity that scales linearly with dimension of the feature space, depth of the partitioning and number of processed data. Through experiments we show that the introduced algorithm outperforms the state-of-the-art ensemble techniques over various well-known machine learning data sets.


  • Open Access

    Adaptive and Efficient Nonlinear Channel Equalization for Underwater Acoustic Communication

    by Dariush Kari, Nuri Denizcan Vanli, Suleyman Serdar Kozat

    We investigate underwater acoustic (UWA) channel equalization and introduce hierarchical and adaptive nonlinear channel equalization algorithms that are highly efficient and provide significantly improved bit error rate (BER) performance. Due to the high complexity of nonlinear equalizers and poor performance of linear ones, to equalize highly difficult underwater acoustic channels, we employ piecewise linear equalizers. However, in order to achieve the performance of the best piecewise linear model, we use a tree structure to hierarchically partition the space of the received signal. Furthermore, the equalization algorithm should be completely adaptive, since due to the highly non-stationary nature of the underwater medium, the optimal MSE equalizer as well as the best piecewise linear equalizer changes in time. To this end, we introduce an adaptive piecewise linear equalization algorithm that not only adapts the linear equalizer at each region but also learns the complete hierarchical structure with a computational complexity only polynomial in the number of nodes of the tree. Furthermore, our algorithm is constructed to directly minimize the final squared error without introducing any ad-hoc parameters. We demonstrate the performance of our algorithms through highly realistic experiments performed on accurately simulated underwater acoustic channels.

  • Open Access

    Stochastic Subgradient Algorithms for Strongly Convex Optimization over Distributed Networks

    by N. Denizcan Vanli, Muhammed O. Sayin, Suleyman S. Kozat

    We study diffusion and consensus based optimization of a sum of unknown convex objective functions over distributed networks. The only access to these functions is through stochastic gradient oracles, each of which is only available at a different node, and a limited number of gradient oracle calls is allowed at each node. In this framework, we introduce a convex optimization algorithm based on the stochastic gradient descent (SGD) updates. Particularly, we use a carefully designed time-dependent weighted averaging of the SGD iterates, which yields a convergence rate of $O\left(\frac{N\sqrt{N}}{T}\right)$ after $T$ gradient updates for each node on a network of $N$ nodes. We then show that after $T$ gradient oracle calls, the average SGD iterate achieves a mean square deviation (MSD) of $O\left(\frac{\sqrt{N}}{T}\right)$. This rate of convergence is optimal as it matches the performance lower bound up to constant terms. Similar to the SGD algorithm, the computational complexity of the proposed algorithm also scales linearly with the dimensionality of the data. Furthermore, the communication load of the proposed method is the same as the communication load of the SGD algorithm. Thus, the proposed algorithm is highly efficient in terms of complexity and communication load. We illustrate the merits of the algorithm with respect to the state-of-art methods over benchmark real life data sets and widely studied network topologies.

  • Open Access

    Competitive linear MMSE estimation under structured data uncertainties

    by N. Denizcan Vanli, Muhammed O. Sayin, Suleyman S. Kozat

    In this paper, we consider the linear estimation problem under structured data uncertainties. A robust algorithm is presented under bounded uncertainties under the mean square error (MSE) criterion. The performance of the linear estimator is defined relative to the performance of the linear minimum MSE (MMSE) estimator tuned to the underlying unknown data uncertainties, i.e., the introduced algorithm has a competitive framework. Then, using this relative performance measure, we find the estimator that minimizes this cost for the worst-case system model. We show that finding this estimator can equivalently be cast as a semidefinite programming (SDP) problem. Numerical examples are provided to illustrate the theoretical results.