default search action
Burak Bartan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Burak Bartan
, Mert Pilanci
Randomized Polar Codes for Anytime Distributed Machine Learning. IEEE J. Sel. Areas Inf. Theory 4: 393-404 (2023) - [j5]Burak Bartan
Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration, and Lower Bounds. IEEE Trans. Inf. Theory 69(6): 3850-3879 (2023) - [c14]Burak Bartan, Mert Pilanci:
Convex Optimization of Deep Polynomial and ReLU Activation Neural Networks. ICASSP 2023: 1-5 - [c13]Wonseok Jeon, Mukul Gagrani, Burak Bartan, Weiliang Will Zeng, Harris Teague, Piero Zappi, Christopher Lott:
Neural DAG Scheduling via One-Shot Priority Sampling. ICLR 2023 - [c12]Burak Bartan, Haoming Li, Harris Teague, Christopher Lott, Bistra Dilkina:
Moccasin: Efficient Tensor Rematerialization for Neural Networks. ICML 2023: 1826-1837 - [i13]Burak Bartan, Haoming Li, Harris Teague, Christopher Lott, Bistra Dilkina:
Moccasin: Efficient Tensor Rematerialization for Neural Networks. CoRR abs/2304.14463 (2023) - [i12]Burak Bartan, Mert Pilanci:
Randomized Polar Codes for Anytime Distributed Machine Learning. CoRR abs/2309.00682 (2023) - 2022
- [c11]Arda Sahiner, Tolga Ergen, Batu Ozturkler, Burak Bartan, John M. Pauly, Morteza Mardani, Mert Pilanci:
Hidden Convexity of Wasserstein GANs: Interpretable Generative Models with Closed-Form Solutions. ICLR 2022 - [c10]Burak Bartan, Mert Pilanci:
Neural Fisher Discriminant Analysis: Optimal Neural Network Embeddings in Polynomial Time. ICML 2022: 1647-1663 - [i11]Burak Bartan, Mert Pilanci:
Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration and Lower Bounds. CoRR abs/2203.09755 (2022) - 2021
- [j4]Aykut Koç
Discrete scaling based on operator theory. Digit. Signal Process. 108: 102904 (2021) - [c9]Vikul Gupta, Burak Bartan, Tolga Ergen
Convex Neural Autoregressive Models: Towards Tractable, Expressive, and Theoretically-Backed Models for Sequential Forecasting and Generation. ICASSP 2021: 3890-3894 - [c8]Burak Bartan, Mert Pilanci:
Training Quantized Neural Networks to Global Optimality via Semidefinite Programming. ICML 2021: 694-704 - [i10]Burak Bartan, Mert Pilanci:
Neural Spectrahedra and Semidefinite Lifts: Global Convex Optimization of Polynomial Activation Neural Networks in Fully Polynomial-Time. CoRR abs/2101.02429 (2021) - [i9]Burak Bartan, Mert Pilanci:
Training Quantized Neural Networks to Global Optimality via Semidefinite Programming. CoRR abs/2105.01420 (2021) - [i8]Arda Sahiner, Tolga Ergen, Batu Ozturkler, Burak Bartan, John M. Pauly, Morteza Mardani, Mert Pilanci:
Hidden Convexity of Wasserstein GANs: Interpretable Generative Models with Closed-Form Solutions. CoRR abs/2107.05680 (2021) - 2020
- [c7]Michal Derezinski, Burak Bartan, Mert Pilanci, Michael W. Mahoney:
Debiasing Distributed Second Order Optimization with Surrogate Sketching and Scaled Regularization. NeurIPS 2020 - [i7]Burak Bartan, Mert Pilanci:
Distributed Sketching Methods for Privacy Preserving Regression. CoRR abs/2002.06538 (2020) - [i6]Burak Bartan, Mert Pilanci:
Distributed Averaging Methods for Randomized Second Order Optimization. CoRR abs/2002.06540 (2020) - [i5]Michal Derezinski, Burak Bartan, Mert Pilanci, Michael W. Mahoney:
Debiasing Distributed Second Order Optimization with Surrogate Sketching and Scaled Regularization. CoRR abs/2007.01327 (2020)
2010 – 2019
- 2019
- [j3]Jay Mardia
Repairing Multiple Failures for Scalar MDS Codes. IEEE Trans. Inf. Theory 65(5): 2661-2672 (2019) - [j2]Aykut Koç
Discrete Linear Canonical Transform Based on Hyperdifferential Operators. IEEE Trans. Signal Process. 67(9): 2237-2248 (2019) - [c6]Burak Bartan, Mert Pilanci:
Distributed Black-Box optimization via Error Correcting Codes. Allerton 2019: 246-252 - [c5]Burak Bartan, Mert Pilanci:
Straggler Resilient Serverless Computing Based on Polar Codes. Allerton 2019: 276-283 - [c4]Burak Bartan, Mert Pilanci:
Convex Relaxations of Convolutional Neural Nets. ICASSP 2019: 4928-4932 - [c3]Jonathan Kuck, Tri Dao, Shenjia Zhao, Burak Bartan, Ashish Sabharwal, Stefano Ermon:
Adaptive Hashing for Model Counting. UAI 2019: 271-280 - [i4]Burak Bartan, Mert Pilanci:
Convex Relaxations of Convolutional Neural Nets. CoRR abs/1901.00035 (2019) - [i3]Burak Bartan, Mert Pilanci:
Polar Coded Distributed Matrix Multiplication. CoRR abs/1901.06811 (2019) - [i2]Burak Bartan, Mert Pilanci:
Distributed Black-Box Optimization via Error Correcting Codes. CoRR abs/1907.05984 (2019) - 2017
- [j1]Aykut Koç
Sparse representation of two- and three-dimensional images with fractional Fourier, Hartley, linear canonical, and Haar wavelet transforms. Expert Syst. Appl. 77: 247-255 (2017) - [c2]Burak Bartan, Mary Wootters:
Repairing multiple failures for scalar MDS codes. Allerton 2017: 1145-1152 - [c1]Aykut Koç
Digital computation of fractional Fourier and linear canonical transforms and sparse image representation. APSIPA 2017: 111-117 - [i1]Burak Bartan, Mary Wootters:
Repairing Multiple Failures for Scalar MDS Codes. CoRR abs/1707.02241 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: