Vasileios Charisopoulos

Vasileios Charisopoulos

Auto-generated profile, based on publicly available information

Vasileios Charisopoulos

Department of Operations Research & Information Engineering Cornell University 14853 Ithaca NY

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 January 2021 in Foundations of Computational Mathematics
Verified
Journal Article
Closed access
PDF file
VCVasileios Charisopoulos
Vasileios Charisopoulos
YCYudong Chen
Yudong Chen
DDDamek Davis
Damek Davis
MDMateo Díaz
Mateo Díaz
LDLijun Ding
Lijun Ding
DDDmitriy Drusvyatskiy
Dmitriy Drusvyatskiy

2 April 2021 in Proceedings of the IEEE
Verified
Journal Article
Open access
PMPetros Maragos
Petros Maragos
VCVasileios Charisopoulos
Vasileios Charisopoulos
ETEmmanouil Theodosis
Emmanouil Theodosis
Tropical geometry is a relatively recent field in mathematics and computer science, combining elements of algebraic geometry and polyhedral geometry. The scalar arithmetic of its analytic part preexisted in the form of max-plus and min-plus semiring arithmetic used in finite automata, nonlinear image processing, convex analysis, nonlinear control, optimization, and idempotent mathematics. Tropical geometry recently emerged in the analysis and extension of several classes of problems and systems in both classical machine learning and deep learning. Three such areas include: 1) deep neural networks with piecewise linear (PWL) activation functions; 2) probabilistic graphical models; and 3) nonlinear regression with PWL functions. In this article, we first summarize introductory ideas and objects of tropical geometry, providing a theoretical framework for both the max-plus algebra that underlies tropical geometry and its extensions to general max algebras. This unifies scalar and vector/signal operations over a class of nonlinear spaces, called weighted lattices, and allows us to provide optimal solutions for algebraic equations used in tropical geometry and generalize tropical geometric objects. Then, we survey the state of the art and recent progress in the aforementioned areas. First, we illustrate a purely geometric approach for studying the representation power of neural networks with PWL activations. Then, we review the tropical geometric analysis of parametric statistical models, such as HMMs; later, we focus on the Viterbi algorithm and related methods for weighted finite-state transducers and provide compact and elegant representations via their formal tropical modeling. Finally, we provide optimal solutions and an efficient algorithm for the convex regression problem, using concepts and tools from tropical geometry and max-plus algebra. Throughout this article, we also outline problems and future directions in machine learning that can benefit from the tropical-geometric point of view.

1 August 2024 in Mathematics of Operations Research
Verified
Journal Article
Closed access
VCVasileios Charisopoulos
Vasileios Charisopoulos
DDDamek Davis
Damek Davis
Subgradient methods comprise a fundamental class of nonsmooth optimization algorithms. Classical results show that certain subgradient methods converge sublinearly for general Lipschitz convex functions and converge linearly for convex functions that grow sharply away from solutions. Recent work has moreover extended these results to certain nonconvex problems. In this work, we seek to improve the complexity of these algorithms by asking the following question. Is it possible to design a superlinearly convergent subgradient method? We provide a positive answer to this question for a broad class of sharp semismooth functions. Funding: The research of D. Davis was supported by the Division of Mathematical Sciences [Grant 2047637] and the Alfred P. Sloan Foundation.

3 February 2025 in Journal of Computational Physics
Verified
Journal Article
Open access
OMOwen Melia
Owen Melia
OTOlivia Tsang
Olivia Tsang
VCVasileios Charisopoulos
Vasileios Charisopoulos
YKYuehaw Khoo
Yuehaw Khoo
JHJeremy Hoskins
Jeremy Hoskins
RWRebecca Willett
Rebecca Willett

23 April 2023 in arXiv
Verified
Preprint
Open access
PDF file
VCVasileios Charisopoulos
Vasileios Charisopoulos
HEHossein Esfandiari
Hossein Esfandiari
VMVahab Mirrokni
Vahab Mirrokni
In this paper, we study the stochastic linear bandit problem under the additional requirements of differential privacy, robustness and batched observations. In particular, we assume an adversary randomly chooses a constant fraction of the observed rewards in each batch, replacing them with arbitrary numbers. We present differentially private and robust variants of the arm elimination algorithm using logarithmic batch queries under two privacy models and provide regret bounds in both settings. In the first model, every reward in each round is reported by a potentially different client, which reduces to standard local differential privacy (LDP). In the second model, every action is "owned" by a different client, who may aggregate the rewards over multiple queries and privatize the aggregate response instead. To the best of our knowledge, our algorithms are the first simultaneously providing differential privacy and adversarial robustness in the stochastic linear bandits problem.

30 January 2019 in arXiv
Verified
Preprint
Open access
PDF file
VCVasileios Charisopoulos
Vasileios Charisopoulos
PMPetros Maragos
Petros Maragos
We present a new, unifying approach following some recent developments on the complexity of neural networks with piecewise linear activations. We treat neural network layers with piecewise linear activations as tropical polynomials, which generalize polynomials in the so-called $(\max, +)$ or tropical algebra, with possibly real-valued exponents. Motivated by the discussion in (arXiv:1402.1869), this approach enables us to refine their upper bounds on linear regions of layers with ReLU or leaky ReLU activations to $\min\left\{ 2^m, \sum_{j=0}^n \binom{m}{j} \right\}$, where $n, m$ are the number of inputs and outputs, respectively. Additionally, we recover their upper bounds on maxout layers. Our work follows a novel path, exclusively under the lens of tropical geometry, which is independent of the improvements reported in (arXiv:1611.01491, arXiv:1711.02114). Finally, we present a geometric approach for effective counting of linear regions using random sampling in order to avoid the computational overhead of exact counting approaches