725 results on '"So, Anthony Man-Cho"'
Search Results
102. ReSync: Riemannian Subgradient-based Robust Rotation Synchronization.
103. Non-convex exact community recovery in stochastic block model
104. Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
105. A Framework for One-Bit and Constant-Envelope Precoding over Multiuser Massive MISO Channels
106. Nonconvex Robust Low-rank Matrix Recovery
107. Minimum Symbol Error Rate-Based Constant Envelope Precoding for Multiuser Massive MISO Downlink
108. Phase Retrieval via Sensor Network Localization
109. On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition
110. SISAL Revisited.
111. Non-convex exact community recovery in stochastic block model.
112. Maximum Flow Routing Strategy With Dynamic Link Allocation for Space Information Networks Under Transceiver Constraints.
113. Probabilistic Simplex Component Analysis.
114. Distributionally Robust Graph Learning From Smooth Signals Under Moment Uncertainty.
115. Local Strong Convexity of Source Localization and Error Bound for Target Tracking under Time-of-Arrival Measurements.
116. Adaptive coordinate sampling for stochastic primal-dual optimization.
117. A Stability Analysis of Fine-Tuning a Pre-Trained Model.
118. Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity.
119. Decoder-Only or Encoder-Decoder? Interpreting Language Model as a Regularized Encoder-Decoder.
120. Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms.
121. Decentralized Weakly Convex Optimization Over the Stiefel Manifold.
122. Vector Transport-Free SVRG with General Retraction for Riemannian Optimization: Complexity Analysis and Practical Implementation
123. Sparse High-Order Portfolios Via Proximal Dca And Sca.
124. An Efficient Alternating Direction Method for Graph Learning from Smooth Signals.
125. Optimal Non-Convex Exact Recovery in Stochastic Block Model via Projected Power Method.
126. A Theoretical Analysis of the Repetition Problem in Text Generation.
127. An Efficient Alternating Riemannian/Projected Gradient Descent Ascent Algorithm for Fair Principal Component Analysis
128. Low-Cost Lipschitz-Independent Adaptive Importance Sampling of Stochastic Gradients.
129. A Fast Proximal Point Algorithm for Generalized Graph Laplacian Learning.
130. A Penalty Alternating Direction Method of Multipliers for Decentralized Composite Optimization.
131. An Efficient Augmented Lagrangian-Based Method for Linear Equality-Constrained Lasso.
132. A Nearly-Linear Time Algorithm for Exact Community Recovery in Stochastic Block Model.
133. A Newton Tracking Algorithm with Exact Linear Convergence Rate for Decentralized Consensus Optimization.
134. Dynamic Regret Bound for Moving Target Tracking Based on Online Time-of-Arrival Measurements.
135. Scalable and Flexible Multiview MAX-VAR Canonical Correlation Analysis
136. A Family of Inexact SQA Methods for Non-Smooth Convex Minimization with Provable Convergence Guarantees Based on the Luo-Tseng Error Bound Property
137. Semidefinite Relaxation and Approximation Analysis of a Beamformed Alamouti Scheme for Relay Beamforming Networks
138. On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization
139. Some Proof Derivations and Further Simulation Results for 'Semidefinite Relaxation and Approximation Analysis of a Beamformed Alamouti Scheme for Relay Beamforming Networks'
140. Unraveling the Rank-One Solution Mystery of Robust MISO Downlink Transmit Optimization: A Verifiable Sufficient Condition via a New Duality Result
141. Nonsmooth Optimization over the Stiefel Manifold and Beyond: Proximal Gradient Method and Recent Variants
142. Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods.
143. A Newton Tracking Algorithm With Exact Linear Convergence for Decentralized Consensus Optimization.
144. Voting-Based Multiagent Reinforcement Learning for Intelligent IoT.
145. A Penalty Alternating Direction Method of Multipliers for Convex Composite Optimization Over Decentralized Networks.
146. Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning.
147. A Unified Approach to Error Bounds for Structured Convex Optimization Problems
148. A Robust Design for MISO Physical-Layer Multicasting over Line-of-Sight Channels
149. A Stochastic Beamformed Amplify-and-Forward Scheme in a Multigroup Multicast MIMO Relay Network with Per-Antenna Power Constraints
150. Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.