default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMihailo Stojnic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i53]Agostino Capponi, Mihailo Stojnic:
Exact Error in Matrix Completion: Approximately Low-Rank Structures and Missing Blocks. CoRR abs/2401.00578 (2024)- [i52]Mihailo Stojnic:
Fixed width treelike neural networks capacity analysis - generic activations. CoRR abs/2402.05696 (2024) - [i51]Mihailo Stojnic:
Exact capacity of the \emph{wide} hidden layer treelike neural networks with generic activations. CoRR abs/2402.05719 (2024) - [i50]Mihailo Stojnic:
Capacity of the Hebbian-Hopfield network associative memory. CoRR abs/2403.01907 (2024) - [i49]Mihailo Stojnic:
Exact objectives of random linear programs and mean widths of random polyhedrons. CoRR abs/2403.03637 (2024) - [i48]Mihailo Stojnic:
Ridge interpolators in correlated factor regression models - exact risk analysis. CoRR abs/2406.09183 (2024) - [i47]Mihailo Stojnic:
Precise analysis of ridge interpolators under heavy correlations - a Random Duality Theory view. CoRR abs/2406.09199 (2024) - 2023
- [c22]Agostino Capponi, Mihailo Stojnic:
Causal Inference - closed form expressions for worst case typical phase transitions. ISIT 2023: 501-506 - [c21]Agostino Capponi, Mihailo Stojnic:
Phase Transitions: Explicit relations for sparse vector and low rank recovery. ISIT 2023: 507-512 - [i46]Agostino Capponi, Mihailo Stojnic:
Causal Inference (C-inf) - closed form worst case typical phase transitions. CoRR abs/2301.00793 (2023) - [i45]Agostino Capponi, Mihailo Stojnic:
Causal Inference (C-inf) - asymmetric scenario of typical phase transitions. CoRR abs/2301.00801 (2023) - [i44]Mihailo Stojnic:
Fully lifted interpolating comparisons of bilinearly indexed random processes. CoRR abs/2311.18092 (2023) - [i43]Mihailo Stojnic:
Bilinearly indexed random processes - stationarization of fully lifted interpolation. CoRR abs/2311.18097 (2023) - [i42]Mihailo Stojnic:
Generic proving of replica symmetry breaking. CoRR abs/2311.18106 (2023) - [i41]Mihailo Stojnic:
Fully lifted random duality theory. CoRR abs/2312.00070 (2023) - [i40]Mihailo Stojnic:
Studying Hopfield models via fully lifted random duality theory. CoRR abs/2312.00071 (2023) - [i39]Mihailo Stojnic:
Binary perceptrons capacity via fully lifted random duality theory. CoRR abs/2312.00073 (2023) - [i38]Mihailo Stojnic:
Capacity of the treelike sign perceptrons neural networks with one hidden layer - RDT based upper bounds. CoRR abs/2312.08244 (2023) - [i37]Mihailo Stojnic:
\emph{Lifted} RDT based capacity analysis of the 1-hidden layer treelike \emph{sign} perceptrons neural networks. CoRR abs/2312.08257 (2023) - [i36]Mihailo Stojnic:
Fl RDT based ultimate lowering of the negative spherical perceptron capacity. CoRR abs/2312.16531 (2023) - 2020
- [i35]Mihailo Stojnic:
Algorithmic random duality theory - large scale CLuP. CoRR abs/2011.11516 (2020) - [i34]Mihailo Stojnic:
Rephased CLuP. CoRR abs/2011.11527 (2020) - [i33]Mihailo Stojnic:
Sparse linear regression - CLuP achieves the ideal \emph{exact} ML. CoRR abs/2011.11550 (2020)
2010 – 2019
- 2019
- [i32]Mihailo Stojnic:
Controlled Loosening-up (CLuP) - achieving exact MIMO ML in polynomial time. CoRR abs/1909.01175 (2019) - [i31]Mihailo Stojnic:
Complexity analysis of the Controlled Loosening-up (CLuP) algorithm. CoRR abs/1909.01190 (2019) - [i30]Mihailo Stojnic:
Starting CLuP with polytope relaxation. CoRR abs/1909.01201 (2019) - 2016
- [i29]Mihailo Stojnic:
Random linear systems with sparse solutions - finite dimensions. CoRR abs/1612.06344 (2016) - [i28]Mihailo Stojnic:
Random linear under-determined systems with block-sparse solutions - asymptotics, large deviations, and finite dimensions. CoRR abs/1612.06516 (2016) - [i27]Mihailo Stojnic:
Box constrained l1 optimization in random linear systems - asymptotics. CoRR abs/1612.06835 (2016) - [i26]Mihailo Stojnic:
Box constrained l1 optimization in random linear systems - finite dimensions. CoRR abs/1612.06839 (2016) - [i25]Mihailo Stojnic:
Partial l1 optimization in random linear systems - phase transitions and large deviations. CoRR abs/1612.07435 (2016) - [i24]Mihailo Stojnic:
Partial l1 optimization in random linear systems - finite dimensions. CoRR abs/1612.07436 (2016) - [i23]Mihailo Stojnic:
Generic and lifted probabilistic comparisons - max replaces minmax. CoRR abs/1612.08506 (2016) - [i22]Mihailo Stojnic:
Fully bilinear generic and lifted random processes comparisons. CoRR abs/1612.08516 (2016) - 2013
- [i21]Mihailo Stojnic:
A rigorous geometry-probability equivalence in characterization of ℓ1-optimization. CoRR abs/1303.7287 (2013) - [i20]Mihailo Stojnic:
Upper-bounding ℓ1-optimization weak thresholds. CoRR abs/1303.7289 (2013) - [i19]Mihailo Stojnic:
A framework to characterize performance of LASSO algorithms. CoRR abs/1303.7291 (2013) - [i18]Mihailo Stojnic:
Regularly random duality. CoRR abs/1303.7295 (2013) - [i17]Mihailo Stojnic:
Optimality of ℓ2/ℓ1-optimization block-length dependent thresholds. CoRR abs/1304.0001 (2013) - [i16]Mihailo Stojnic:
A performance analysis framework for SOCP algorithms in noisy compressed sensing. CoRR abs/1304.0002 (2013) - [i15]Mihailo Stojnic:
Meshes that trap random subspaces. CoRR abs/1304.0003 (2013) - [i14]Mihailo Stojnic:
Linear under-determined systems with sparse solutions: Redirecting a challenge? CoRR abs/1304.0004 (2013) - [i13]Mihailo Stojnic:
A problem dependent analysis of SOCP algorithms in noisy compressed sensing. CoRR abs/1304.0480 (2013) - [i12]Mihailo Stojnic:
Bounding ground state energy of Hopfield models. CoRR abs/1306.3764 (2013) - [i11]Mihailo Stojnic:
Lifting ℓ1-optimization strong and sectional thresholds. CoRR abs/1306.3770 (2013) - [i10]Mihailo Stojnic:
Under-determined linear systems and ℓq-optimization thresholds. CoRR abs/1306.3774 (2013) - [i9]Mihailo Stojnic:
Upper-bounding ℓ1-optimization sectional thresholds. CoRR abs/1306.3778 (2013) - [i8]Mihailo Stojnic:
Bounds on restricted isometry constants of random matrices. CoRR abs/1306.3779 (2013) - [i7]Mihailo Stojnic:
Towards a better compressed sensing. CoRR abs/1306.3801 (2013) - [i6]Mihailo Stojnic:
Lifting/lowering Hopfield models ground state energies. CoRR abs/1306.3975 (2013) - [i5]Mihailo Stojnic:
Lifting ℓq-optimization thresholds. CoRR abs/1306.3976 (2013) - [i4]Mihailo Stojnic:
Compressed sensing of block-sparse positive vectors. CoRR abs/1306.3977 (2013) - 2010
- [j4]Mihailo Stojnic:
2/ 1 -Optimization in Block-Sparse Compressed Sensing and Its Strong Thresholds. IEEE J. Sel. Top. Signal Process. 4(2): 350-357 (2010) - [c20]Mihailo Stojnic:
l1 optimization and its various thresholds in compressed sensing. ICASSP 2010: 3910-3913 - [c19]Mihailo Stojnic:
Block-length dependent thresholds for l2/l1-optimization in block-sparse compressed sensing. ICASSP 2010: 3918-3921 - [c18]Mihailo Stojnic:
A smoothed analysis approach to l1 optimization in compressed sensing. ICASSP 2010: 3922-3925 - [c17]Mihailo Stojnic:
Towards improving l1 optimization in compressed sensing. ICASSP 2010: 3938-3941 - [c16]Mihailo Stojnic:
Recovery thresholds for ℓ1 optimization in binary compressed sensing. ISIT 2010: 1593-1597
2000 – 2009
- 2009
- [j3]Mihailo Stojnic, Farzad Parvaresh, Babak Hassibi:
On the reconstruction of block-sparse signals with an optimal number of measurements. IEEE Trans. Signal Process. 57(8): 3075-3085 (2009) - [c15]Mihailo Stojnic:
A simple performance analysis of l1 optimization in compressed sensing. ICASSP 2009: 3021-3024 - [c14]Mihailo Stojnic:
Strong thresholds for l2/l1-optimization in block-sparse compressed sensing. ICASSP 2009: 3025-3028 - [c13]Mihailo Stojnic:
ℓ2/ℓ1-optimization and its strong thresholds in approximately block-sparse compressed sensing. ISIT 2009: 473-477 - [c12]Mihailo Stojnic:
Explicit thresholds for approximately sparse compressed sensing via ℓ1-optimization. ISIT 2009: 478-482 - [i3]Mihailo Stojnic:
Various thresholds for ℓ1-optimization in compressed sensing. CoRR abs/0907.3666 (2009) - [i2]Mihailo Stojnic:
Block-length dependent thresholds in block-sparse compressed sensing. CoRR abs/0907.3679 (2009) - 2008
- [j2]Mihailo Stojnic, Haris Vikalo, Babak Hassibi:
Speeding up the Sphere Decoder With Hinfty and SDP Inspired Lower Bounds. IEEE Trans. Signal Process. 56(2): 712-726 (2008) - [c11]Weiyu Xu, Mihailo Stojnic, Babak Hassibi:
Low-complexity blind maximum-likelihood detection for SIMO systems with general constellations. ICASSP 2008: 2817-2820 - [c10]Mihailo Stojnic, Weiyu Xu, Babak Hassibi:
Compressed sensing - probabilistic analysis of a null-space characterization. ICASSP 2008: 3377-3380 - [c9]Weiyu Xu, Mihailo Stojnic, Babak Hassibi:
ON exact maximum-likelihood detection for non-coherent MIMO wireless systems: A branch-estimate-bound optimization framework. ISIT 2008: 2017-2021 - [c8]Mihailo Stojnic, Weiyu Xu, Babak Hassibi:
Compressed sensing of approximately sparse signals. ISIT 2008: 2182-2186 - [i1]Mihailo Stojnic, Farzad Parvaresh, Babak Hassibi:
On the reconstruction of block-sparse signals with an optimal number of measurements. CoRR abs/0804.0041 (2008) - 2007
- [c7]Mihailo Stojnic, Babak Hassibi, Haris Vikalo:
PEP Analysis of the SDP Based Joint Channel Estimation and Signal Detection. ICASSP (3) 2007: 69-72 - [c6]Mihailo Stojnic, Babak Hassibi:
Unambiguous discrimination between two rank-2 mixed quantum states. ISIT 2007: 261-265 - [c5]Mihailo Stojnic, Babak Hassibi, Haris Vikalo:
PEP analysis of SDP-based non-coherent signal detection. ISIT 2007: 2916-2920 - 2006
- [j1]Mihailo Stojnic, Haris Vikalo, Babak Hassibi:
Rate maximization in multi-antenna broadcast channels with linear preprocessing. IEEE Trans. Wirel. Commun. 5(9): 2338-2342 (2006) - [c4]Mihailo Stojnic, Haris Vikalo, Babak Hassibi:
Further Results on Speeding up the Sphere Decoder. ICASSP (4) 2006: 549-552 - [c3]Mihailo Stojnic, Haris Vikalo, Babak Hassibi:
Asymptotic Analysis of the Gaussian Broadcast Channel with Perturbation Preprocessing. ICASSP (4) 2006: 777-780 - 2005
- [c2]Mihailo Stojnic, Haris Vikalo, Babak Hassibi:
A branch and bound approach to speed up the sphere decoder. ICASSP (3) 2005: 429-432 - 2004
- [c1]Mihailo Stojnic, Haris Vikalo, Babak Hassibi:
Rate maximization in multi-antenna broadcast channels with linear preprocessing. GLOBECOM 2004: 3957-3961
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-07-25 19:24 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:
