Burak Hasircioglu

Burak Hasircioglu

Auto-generated profile, based on publicly available information

Burak Hasircioglu

Alan Turing Institute, London, NW1, U.K

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
20 August 2021 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
BHBurak Hasircioglu
Burak Hasircioglu
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
DGDeniz Gunduz
Deniz Gunduz
Coded computing is an effective technique to mitigate “stragglers” in large-scale and distributed matrix multiplication. In particular, univariate polynomial codes have been shown to be effective in straggler mitigation by making the computation time depend only on the fastest workers. However, these schemes completely ignore the work done by the straggling workers resulting in a waste of computational resources. To reduce the amount of work left unfinished at workers, one can further decompose the matrix multiplication task into smaller sub-tasks, and assign multiple sub-tasks to each worker, possibly heterogeneously, to better fit their particular storage and computation capacities. In this work, we propose a novel family of bivariate polynomial codes to efficiently exploit the work carried out by straggling workers. We show that bivariate polynomial codes bring significant advantages in terms of upload communication costs and storage efficiency, measured in terms of the number of sub-tasks that can be computed per worker. We propose two bivariate polynomial coding schemes. The first one exploits the fact that bivariate interpolation is always possible on a rectangular grid of evaluation points. We obtain such points at the cost of adding some redundant computations. For the second scheme, we relax the decoding constraints and require decodability for almost all choices of the evaluation points. We present interpolation sets satisfying such decodability conditions for certain storage configurations of workers. Our numerical results show that bivariate polynomial coding considerably reduces the average computation time of distributed matrix multiplication. We believe this work opens up a new class of previously unexplored coding schemes for efficient coded distributed computation.

13 January 2022 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
BHBurak Hasırcıoǧlu
Burak Hasırcıoǧlu
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
DGDeniz Gunduz
Deniz Gunduz
We consider the problem of secure distributed matrix multiplication (SDMM). Coded computation has been shown to be an effective solution in distributed matrix multiplication, both providing privacy against workers and boosting the computation speed by efficiently mitigating stragglers. In this work, we present a non-direct secure extension of the recently introduced bivariate polynomial codes. Bivariate polynomial codes have been shown to be able to further speed up distributed matrix multiplication by exploiting the partial work done by the stragglers rather than completely ignoring them while reducing the upload communication cost and/or the workers’ storage’s capacity needs. We show that, especially for upload communication or storage constrained settings, the proposed approach reduces the average computation time of SDMM compared to its competitors in the literature.

6 January 2025 in IEEE Transactions on Machine Learning in Communications and Networking
Verified
Journal Article
Open access
SYSelim F. Yilmaz
Selim F. Yilmaz
BHBurak Hasırcıo˘glu
Burak Hasırcıo˘glu
LQLi Qiao
Li Qiao
DGDeniz Gunduz
Deniz Gunduz
We consider collaborative inference at the wireless edge, where each client’s model is trained independently on its local dataset. Clients are queried in parallel to make an accurate decision collaboratively. In addition to maximizing the inference accuracy, we also want to ensure the privacy of local models. To this end, we leverage the superposition property of the multiple access channel to implement bandwidth-efficient multi-user inference methods. We propose different methods for ensemble and multi-view classification that exploit over-the-air computation (OAC). We show that these schemes perform better than their orthogonal counterparts with statistically significant differences while using fewer resources and providing privacy guarantees. We also provide experimental results verifying the benefits of the proposed OAC approach to multi-user inference, and perform an ablation study to demonstrate the effectiveness of our design choices. We share the source code of the framework publicly on Github to facilitate further research and reproducibility.

16 March 2026 in IEEE Security & Privacy
Verified
Journal Article
Closed access
SASharif Abuadbba
Sharif Abuadbba
KMKristen Moore
Kristen Moore
DGDiksha Goel
Diksha Goel
CHChris Hicks
Chris Hicks
VMVasilios Mavroudis
Vasilios Mavroudis
PJPiers Jennings
Piers Jennings
This position article maps large language model (LLM) capabilities onto the MITRE ATT&CK and NIST Cybersecurity Frameworks. While LLMs exhibit fluency and versatility across cybersecurity tasks, they remain fragile in complex, high-stakes settings due to limited context retention, hallucinations, and reasoning gaps.

6 February 2022 in arXiv
Verified
Preprint
Open access
PDF file
BHBurak Hasircioglu
Burak Hasircioglu
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
DGDeniz Gunduz
Deniz Gunduz
We consider the problem of secure distributed matrix multiplication (SDMM). Coded computation has been shown to be an effective solution in distributed matrix multiplication, both providing privacy against workers and boosting the computation speed by efficiently mitigating stragglers. In this work, we present a non-direct secure extension of the recently introduced bivariate polynomial codes. Bivariate polynomial codes have been shown to be able to further speed up distributed matrix multiplication by exploiting the partial work done by the stragglers rather than completely ignoring them while reducing the upload communication cost and/or the workers' storage's capacity needs. We show that, especially for upload communication or storage constrained settings, the proposed approach reduces the average computation time of SDMM compared to its competitors in the literature.

13 July 2021 in arXiv
Verified
Preprint
Open access
PDF file
BHBurak Hasircioglu
Burak Hasircioglu
JVJesús Gómez Vilardebó
Jesús Gómez Vilardebó
DGDeniz Gunduz
Deniz Gunduz
We consider the problem of private distributed matrix multiplication under limited resources. Coded computation has been shown to be an effective solution in distributed matrix multiplication, both providing privacy against the workers and boosting the computation speed by efficiently mitigating stragglers. In this work, we propose the use of recently-introduced bivariate polynomial codes to further speed up private distributed matrix multiplication by exploiting the partial work done by the stragglers rather than completely ignoring them. We show that the proposed approach reduces the average computation time of private distributed matrix multiplication compared to its competitors in the literature while improving the upload communication cost and the workers' storage efficiency.