The following pages link to author name string (P43):
Displaying 50 items.
- MomentumRNN: Integrating Momentum into Recurrent Neural Networks (Q6342721) (← links)
- Kernel Distributionally Robust Optimization (Q6342731) (← links)
- Intelligent Reflecting Surface Operation under Predictable Receiver Mobility: A Continuous Time Propagation Model (Q6342733) (← links)
- ACMo: Angle-Calibrated Moment Methods for Stochastic Optimization (Q6342752) (← links)
- Reinforced Data Sampling for Model Diversification (Q6342759) (← links)
- Minimax Estimation of Conditional Moment Models (Q6342769) (← links)
- Consistent Estimation of Identifiable Nonparametric Mixture Models from Grouped Observations (Q6342805) (← links)
- Sparse Separable Nonnegative Matrix Factorization (Q6342814) (← links)
- Optimistic Distributionally Robust Policy Optimization (Q6342854) (← links)
- Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence (Q6342864) (← links)
- Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficient (Q6342880) (← links)
- Fast Robust Subspace Tracking via PCA in Sparse Data-Dependent Noise (Q6342889) (← links)
- Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding Design for Multiuser MIMO Systems (Q6342900) (← links)
- Derivative-free global minimization for a class of multiple minima problems (Q6342919) (← links)
- Deep-CAPTCHA: a deep learning based CAPTCHA solver for vulnerability assessment (Q6342938) (← links)
- Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization (Q6342952) (← links)
- Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks (Q6342972) (← links)
- Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reduction (Q6342974) (← links)
- Total Deep Variation: A Stable Regularizer for Inverse Problems (Q6342999) (← links)
- Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterization (Q6343002) (← links)
- Practical Quasi-Newton Methods for Training Deep Neural Networks (Q6343003) (← links)
- Federated Accelerated Stochastic Gradient Descent (Q6343011) (← links)
- Robust Compressed Sensing using Generative Models (Q6343071) (← links)
- Towards improving discriminative reconstruction via simultaneous dense and sparse coding (Q6343081) (← links)
- Multipole Graph Neural Operator for Parametric Partial Differential Equations (Q6343082) (← links)
- Causal Meta-Mediation Analysis: Inferring Dose-Response Function From Summary Statistics of Many Randomized Experiments (Q6343106) (← links)
- Occam's Ghost (Q6343122) (← links)
- Using Wavelets and Spectral Methods to Study Patterns in Image-Classification Datasets (Q6343131) (← links)
- Robust Persistence Diagrams using Reproducing Kernels (Q6343143) (← links)
- Competitive Mirror Descent (Q6343161) (← links)
- Revisiting minimum description length complexity in overparameterized models (Q6343162) (← links)
- Distribution-free binary classification: prediction sets, confidence intervals and calibration (Q6343213) (← links)
- Minimax Lower Bounds for Transfer Learning with Linear and One-hidden Layer Neural Networks (Q6343216) (← links)
- AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity (Q6343235) (← links)
- An adaptive stochastic gradient-free approach for high-dimensional blackbox optimization (Q6343255) (← links)
- The Normal-Generalised Gamma-Pareto process: A novel pure-jump L\'evy process with flexible tail and jump-activity properties (Q6343262) (← links)
- Mixture of Conditional Gaussian Graphical Models for unlabelled heterogeneous populations in the presence of co-factors (Q6343272) (← links)
- Poisson Learning: Graph Based Semi-Supervised Learning At Very Low Label Rates (Q6343287) (← links)
- A polynomial-time algorithm for learning nonparametric causal graphs (Q6343409) (← links)
- Lipschitz Recurrent Neural Networks (Q6343423) (← links)
- Differentially Private Convex Optimization with Feasibility Guarantees (Q6343451) (← links)
- A Convergent and Dimension-Independent Min-Max Optimization Algorithm (Q6343459) (← links)
- Information Theoretic Regret Bounds for Online Nonlinear Control (Q6343475) (← links)
- Optimal Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency (Q6343551) (← links)
- JCR70: A Low-Complexity Millimeter-Wave Proof-of-Concept Platform for A Fully-Digital MIMO Joint Communication-Radar (Q6343592) (← links)
- Standardized Non-Intrusive Reduced Order Modeling Using Different Regression Models With Application to Complex Flow Problems (Q6343636) (← links)
- Robust and Efficient Approximate Bayesian Computation: A Minimum Distance Approach (Q6343696) (← links)
- Model-free bounds for multi-asset options using option-implied information and their exact computation (Q6343716) (← links)
- Dual-Free Stochastic Decentralized Optimization with Variance Reduction (Q6343733) (← links)
- The Quenching-Activation Behavior of the Gradient Descent Dynamics for Two-layer Neural Network Models (Q6343743) (← links)
