The following pages link to author name string (P43):
Displaying 50 items.
- On the Possibility of Rewarding Structure Learning Agents: Mutual Information on Linguistic Random Sets (Q6326863) (← links)
- The Area of the Convex Hull of Sampled Curves: a Robust Functional Statistical Depth Measure (Q6326871) (← links)
- Validated Variational Inference via Practical Posterior Error Bounds (Q6326873) (← links)
- Probabilistic Verification and Reachability Analysis of Neural Networks via Semidefinite Programming (Q6326896) (← links)
- PAC-Bayesian Contrastive Unsupervised Representation Learning (Q6326927) (← links)
- Online control of the familywise error rate (Q6326973) (← links)
- Fast and Furious Convergence: Stochastic Second Order Methods under Interpolation (Q6326977) (← links)
- Demon: Improved Neural Network Training with Momentum Decay (Q6326983) (← links)
- Optimal Approximation of Doubly Stochastic Matrices (Q6327032) (← links)
- Quantitative stability of optimal transport maps and linearization of the 2-Wasserstein space (Q6327127) (← links)
- Understanding the Limitations of Variational Mutual Information Estimators (Q6327164) (← links)
- SCAFFOLD: Stochastic Controlled Averaging for Federated Learning (Q6327187) (← links)
- BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization (Q6327190) (← links)
- When Nash Meets Stackelberg (Q6327200) (← links)
- Optimal Codes Correcting a Single Indel / Edit for DNA-Based Data Storage (Q6327208) (← links)
- ZO-AdaMM: Zeroth-Order Adaptive Momentum Method for Black-Box Optimization (Q6327210) (← links)
- Joint Sparse Beamforming and Power Control for Large-scale DAS with Network-Assisted Full Duplex (Q6327234) (← links)
- A Simple Proof of the Quadratic Formula (Q6327235) (← links)
- Generic Bounds on the Maximum Deviations in Sequential Prediction: An Information-Theoretic Analysis (Q6327240) (← links)
- Dynamic Graph Configuration with Reinforcement Learning for Connected Autonomous Vehicle Trajectories (Q6327245) (← links)
- A greedy anytime algorithm for sparse PCA (Q6327255) (← links)
- Deep Learning for Massive MIMO with 1-Bit ADCs: When More Antennas Need Fewer Pilots (Q6327274) (← links)
- Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization (Q6327375) (← links)
- Robust Planning and Control For Polygonal Environments via Linear Programming (Q6327396) (← links)
- Anderson Acceleration of Proximal Gradient Methods (Q6327475) (← links)
- Infinite-Horizon Optimal Control of Switched Boolean Control Networks with Average Cost: An Efficient Graph-Theoretical Approach (Q6327494) (← links)
- Dynamic Subgoal-based Exploration via Bayesian Optimization (Q6327557) (← links)
- Adaptive Gradient Descent without Descent (Q6327620) (← links)
- Meta-Learning to Communicate: Fast End-to-End Training for Fading Channels (Q6327678) (← links)
- Proximal Adam: Robust Adaptive Update Scheme for Constrained Optimization (Q6327693) (← links)
- Multiple outlier detection tests for parametric models (Q6327741) (← links)
- Nested conformal prediction and quantile out-of-bag ensemble methods (Q6327752) (← links)
- Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation (Q6327756) (← links)
- Accelerated Primal-Dual Algorithms for Distributed Smooth Convex Optimization over Networks (Q6327767) (← links)
- Dynamic multi-agent assignment via discrete optimal transport (Q6327772) (← links)
- Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine Learning (Q6327936) (← links)
- Differentiable Convex Optimization Layers (Q6327983) (← links)
- Testing Forecast Rationality for Measures of Central Tendency (Q6327999) (← links)
- A First-Order Algorithmic Framework for Wasserstein Distributionally Robust Logistic Regression (Q6328026) (← links)
- Sinkhorn Divergences for Unbalanced Optimal Transport (Q6328051) (← links)
- Poincar\'e Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games (Q6328059) (← links)
- Efficiently avoiding saddle points with zero order methods: No gradients required (Q6328061) (← links)
- Bayesian Optimization with Unknown Search Space (Q6328071) (← links)
- Understanding the Role of Momentum in Stochastic Gradient Methods (Q6328197) (← links)
- Superset Technique for Approximate Recovery in One-Bit Compressed Sensing (Q6328198) (← links)
- Multi-resolution CSI Feedback with deep learning in Massive MIMO System (Q6328246) (← links)
- Denoising and Regularization via Exploiting the Structural Bias of Convolutional Generators (Q6328299) (← links)
- Making an Invisibility Cloak: Real World Adversarial Attacks on Object Detectors (Q6328309) (← links)
- An Approximate Message Passing Algorithm for Rapid Parameter-Free Compressed Sensing MRI (Q6328478) (← links)
- Deployment Architectures for Cyber-Physical Control Systems (Q6328512) (← links)
