activity
20202026
most citedCould ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants

36 citations · 44 across the 8 of their papers we have counts for

collaborators

8 papers

cs.LG2026

Faster Inference of Flow-Based Generative Models via Improved Data-Noise Coupling

Aram Davtyan, Leello Tadesse Dadi, Volkan Cevher +1

Conditional Flow Matching (CFM), a simulation-free method for training continuous normalizing flows, provides an efficient alternative to diffusion models for key tasks like image…

cs.CY2024★ 36 cited

Could ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants

Beatriz Borges, Negar Foroutan, Deniz Bayazit +87

AI assistants are being increasingly used by students enrolled in higher education institutions. While these tools provide opportunities for improved teaching and education, they a…

math.OC2024

Efficient Continual Finite-Sum Minimization

Ioannis Mavrothalassitis, Stratis Skoulakis, Leello Tadesse Dadi +1

Given a sequence of functions with , finite-sum minimization seeks a point minimizing $\sum_{j=1}^n…

stat.ML2024★ 4 cited

Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks

Fanghui Liu, Leello Dadi, Volkan Cevher

Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks as the curse of dimensionality (CoD) cannot be evad…

cs.GT2024

Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games

Leello Dadi, Ioannis Panageas, Stratis Skoulakis +2

We introduce an online learning algorithm in the bandit feedback model that, once adopted by all agents of a congestion game, results in game-dynamics that converge to an -appro…

math.OC2022★ 1 cited

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

Ali Kavis, Stratis Skoulakis, Kimon Antonakopoulos +2

We propose an adaptive variance-reduction method, called AdaSpider, for minimization of -smooth, non-convex functions with a finite-sum structure. In essence, AdaSpider combines…

cs.LG2022

The Spectral Bias of Polynomial Neural Networks

Moulik Choraria, Leello Tadesse Dadi, Grigorios Chrysos +2

Polynomial neural networks (PNNs) have been recently shown to be particularly effective at image generation and face recognition, where high-frequency information is critical. Prev…

math.ST2020★ 3 cited

Generating Sparse Stochastic Processes Using Matched Splines

Leello Dadi, Shayan Aziznejad, Michael Unser

We provide an algorithm to generate trajectories of sparse stochastic processes that are solutions of linear ordinary differential equations driven by Lévy white noises. A recent p…