Pages that link to "Item:Q4959462"

The following pages link to SIAM Journal on Mathematics of Data Science (Q4959462):

Displaying 50 items.

• Test Data Reuse for the Evaluation of Continuously Evolving Classification Algorithms Using the Area under the Receiver Operating Characteristic Curve (Q4959463) (← links)
• Distributed Learning with Sparse Communications by Identification (Q4959464) (← links)
• Analysis of the Neighborhood Pattern Similarity Measure for the Role Extraction Problem (Q4959466) (← links)
• Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products (Q4959467) (← links)
• Admissibility of Solution Estimators for Stochastic Optimization (Q4999345) (← links)
• Maximum Entropy Methods for Texture Synthesis: Theory and Practice (Q4999346) (← links)
• The Convex Mixture Distribution: Granger Causality for Categorical Time Series (Q4999347) (← links)
• Spectral Neighbor Joining for Reconstruction of Latent Tree Models (Q4999349) (← links)
• Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks (Q4999351) (← links)
• Scalable Semidefinite Programming (Q4999352) (← links)
• Multikernel Regression with Sparsity Constraint (Q4999353) (← links)
• Error Bounds for Dynamical Spectral Estimation (Q4999356) (← links)
• Tensor Methods for Nonlinear Matrix Completion (Q4999357) (← links)
• Diversity Sampling is an Implicit Regularization for Kernel Methods (Q4999358) (← links)
• Finite-Time Performance of Distributed Temporal-Difference Learning with Linear Function Approximation (Q4999359) (← links)
• Transport Model for Feature Extraction (Q4999360) (← links)
• Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin (Q4999361) (← links)
• A Performance Guarantee for Spectral Clustering (Q4999362) (← links)
• Doubly Stochastic Normalization of the Gaussian Kernel Is Robust to Heteroskedastic Noise (Q4999363) (← links)
• Generalization Error of Minimum Weighted Norm and Kernel Interpolation (Q4999364) (← links)
• Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries (Q4999366) (← links)
• A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities (Q4999367) (← links)
• Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition (Q4999368) (← links)
• An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems (Q4999369) (← links)
• Binary Component Decomposition Part I: The Positive-Semidefinite Case (Q4999392) (← links)
• Normal-Bundle Bootstrap (Q4999394) (← links)
• Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (Q4999395) (← links)
• The Gap between Theory and Practice in Function Approximation with Deep Neural Networks (Q4999396) (← links)
• Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization (Q4999399) (← links)
• Global Minima of Overparameterized Neural Networks (Q4999400) (← links)
• Convergence of Recursive Stochastic Algorithms Using Wasserstein Divergence (Q5018894) (← links)
• Mean-Field Controls with Q-Learning for Cooperative MARL: Convergence and Complexity Analysis (Q5018896) (← links)
• MR-GAN: Manifold Regularized Generative Adversarial Networks for Scientific Data (Q5018897) (← links)
• An Optimal Algorithm for Strict Circular Seriation (Q5018899) (← links)
• On the Effectiveness of Richardson Extrapolation in Data Science (Q5018900) (← links)
• On the Bias, Risk, and Consistency of Sample Means in Multi-armed Bandits (Q5018902) (← links)
• Interpretable Approximation of High-Dimensional Data (Q5018903) (← links)
• Consistency of Archetypal Analysis (Q5019779) (← links)
• A Nonlinear Spectral Method for Core--Periphery Detection in Networks (Q5025758) (← links)
• Three Hypergraph Eigenvector Centralities (Q5025759) (← links)
• Clustering with t-SNE, Provably (Q5025760) (← links)
• Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
• Multivariate Spatiotemporal Hawkes Processes and Network Reconstruction (Q5025763) (← links)
• A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance (Q5025764) (← links)
• Relating Modularity Maximization and Stochastic Block Models in Multilayer Networks (Q5025766) (← links)
• Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors (Q5025767) (← links)
• Singularity Structures and Impacts on Parameter Estimation in Finite Mixtures of Distributions (Q5025768) (← links)
• A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms (Q5025771) (← links)
• Consistency of Lipschitz Learning with Infinite Unlabeled Data and Finite Labeled Data (Q5025772) (← links)
• Optimal Approximation with Sparsely Connected Deep Neural Networks (Q5025773) (← links)