485 results on '"Andrea Montanari"'
Search Results
102. Tight Thresholds for Cuckoo Hashing via XORSAT.
103. Learning Networks of Stochastic Differential Equations.
104. The LASSO risk: asymptotic results and real world examples.
105. Analysis of approximate message passing algorithm.
106. Statistical static timing analysis using Markov chain Monte Carlo.
107. Regularization for matrix completion.
108. The dynamics of message passing on dense graphs, with applications to compressed sensing.
109. On the deletion channel with small deletion probability.
110. An empirical scaling law for polar codes.
111. Finding Hidden Cliques of Size √(N/e) in Nearly Linear Time.
112. Bargaining dynamics in exchange networks.
113. Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration.
114. Convergence to Equilibrium in Local Interaction Games.
115. Matrix Completion from Noisy Entries.
116. Which graphical models are difficult to learn?
117. An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources.
118. Low-rank matrix completion with noisy observations: A quantitative comparison.
119. Matrix completion from a few entries.
120. An iterative scheme for near optimal and universal lossy compression.
121. Generating random graphs with large girth.
122. Counter Braids: Asymptotic optimality of the message passing decoding algorithm.
123. Learning low rank matrices from O(n) entries.
124. Smooth compression, Gallager bound and nonlinear sparse-graph codes.
125. The slope scaling parameter for general channels, decoders, and ensembles.
126. Computing the threshold shift for general channels.
127. Counter braids: a novel counter architecture for per-flow measurement.
128. Reconstruction for Models on Random Graphs.
129. Asymptotic Rate versus Design Rate.
130. A Generalization of the Finite-Length Scaling Approach Beyond the BEC.
131. Counting good truth assignments of random k-SAT formulae.
132. Analytic Determination of Scaling Parameters.
133. Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka's Formula).
134. Maximum a posteriori decoding and turbo codes for general memoryless channels.
135. Finite-length scaling of irregular LDPC code ensembles.
136. The Generalization Error of Random Features Regression: Precise Asymptotics and the Double Descent Curve
137. On the concentration of the number of solutions of random satisfiability formulas.
138. Hypothesis Testing in High-Dimensional Regression Under the Gaussian Random Design Model: Asymptotic Theory.
139. Confidence intervals and hypothesis testing for high-dimensional regression.
140. Accelerated Time-of-Flight Mass Spectrometry.
141. Group Synchronization on Grids.
142. Learning Combinations of Sigmoids Through Gradient Estimation.
143. Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.
144. Non-negative Matrix Factorization via Archetypal Analysis.
145. State Evolution for Approximate Message Passing with Non-Separable Functions.
146. A Low-Cost Method for Multiple Disease Prediction.
147. Privacy-Utility Trade-Off for Time-Series with Application to Smart-Meter Data.
148. Localization from Incomplete Noisy Distance Measurements.
149. Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing.
150. Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.