:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Pfeiffer, Pia, Alfons, Andreas, Filzmoser, Peter
Format:	Preprint
Published:	2023
Subjects:	Computation Machine Learning
Online Access:	https://arxiv.org/abs/2311.17563
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cellwise robust and sparse principal component analysis
by: Pfeiffer, Pia, et al.
Published: (2024)

Sparse outlier-robust PCA for multi-source data
by: Puchhammer, Patricia, et al.
Published: (2024)

Robust Matrix Completion for Discrete Rating-Scale Data: Coping with Fake Profiles in Recommender Systems
by: Archimbaud, Aurore, et al.
Published: (2024)

Improving Forecasts for Heterogeneous Time Series by "Averaging", with Application to Food Demand Forecast
by: Neubauer, Lukas, et al.
Published: (2023)

Multivariate outlier explanations using Shapley values and Mahalanobis distances
by: Mayrhofer, Marcus, et al.
Published: (2022)

Fast and Robust: Computationally Efficient Covariance Estimation for Sub-Weibull Vectors
by: He, Even
Published: (2025)

Improving Automated Hemorrhage Detection in Sparse-view Computed Tomography via Deep Convolutional Neural Network based Artifact Reduction
by: Thalhammer, Johannes, et al.
Published: (2023)

Generative Bayesian Computation for Maximum Expected Utility
by: Polson, Nick, et al.
Published: (2024)

Efficient Sparse PCA via Block-Diagonalization
by: Del Pia, Alberto, et al.
Published: (2024)

When Respondents Don't Care Anymore: Identifying the Onset of Careless Responding
by: Welz, Max, et al.
Published: (2023)

Momentum SVGD-EM for Accelerated Maximum Marginal Likelihood Estimation
by: Rozzio, Adam, et al.
Published: (2026)

Adaptively Robust and Sparse K-means Clustering
by: Li, Hao, et al.
Published: (2024)

LITE: Efficiently Estimating Gaussian Probability of Maximality
by: Menet, Nicolas, et al.
Published: (2025)

Sparse Query Attention (SQA): A Computationally Efficient Attention Mechanism with Query Heads Reduction
by: Filipek, Adam
Published: (2025)

Interacting Particle Langevin Algorithm for Maximum Marginal Likelihood Estimation
by: Akyildiz, Ö. Deniz, et al.
Published: (2023)

Predictive change point detection for heterogeneous data
by: Glock, Anna-Christina, et al.
Published: (2023)

Offline Preference Optimization via Maximum Marginal Likelihood Estimation
by: Najafi, Saeed, et al.
Published: (2025)

AnchorAL: Computationally Efficient Active Learning for Large and Imbalanced Datasets
by: Lesci, Pietro, et al.
Published: (2024)

Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation
by: Jacobs, Peter Matthew, et al.
Published: (2026)

Sparse minimum Redundancy Maximum Relevance for feature selection
by: Naylor, Peter, et al.
Published: (2025)

SparseEval: Efficient Evaluation of Large Language Models by Sparse Optimization
by: Zhang, Taolin, et al.
Published: (2026)

Rectified LpJEPA: Joint-Embedding Predictive Architectures with Sparse and Maximum-Entropy Representations
by: Kuang, Yilun, et al.
Published: (2026)

SEA: Sparse Linear Attention with Estimated Attention Mask
by: Lee, Heejun, et al.
Published: (2023)

spar: Sparse Projected Averaged Regression in R
by: Parzer, Roman, et al.
Published: (2024)

Particle swarm optimization with Applications to Maximum Likelihood Estimation and Penalized Negative Binomial Regression
by: Shao, Sisi, et al.
Published: (2024)

Toward a Flexible Framework for Linear Representation Hypothesis Using Maximum Likelihood Estimation
by: Nguyen, Trung, et al.
Published: (2025)

Sparse NMF with Archetypal Regularization: Computational and Robustness Properties
by: Behdin, Kayhan, et al.
Published: (2021)

Associative-State Universal Transformers: Sparse Retrieval Meets Structured Recurrence
by: Xiao, Liu
Published: (2026)

STS: Efficient Sparse Attention with Speculative Token Sparsity
by: Xu, Ceyu, et al.
Published: (2026)

Learnable Sparse Customization in Heterogeneous Edge Computing
by: Xue, Jingjing, et al.
Published: (2024)

BiSparse-AAS: Bilinear Sparse Attention and Adaptive Spans Framework for Scalable and Efficient Text Summarization
by: Hagos, Desta Haileselassie, et al.
Published: (2025)

SparseTransX: Efficient Training of Translation-Based Knowledge Graph Embeddings Using Sparse Matrix Operations
by: Anik, Md Saidul Hoque, et al.
Published: (2025)

Sparse Attention Remapping with Clustering for Efficient LLM Decoding on PIM
by: Fan, Zehao, et al.
Published: (2025)

Adaptive Sharpness-Aware Pruning for Robust Sparse Networks
by: Bair, Anna, et al.
Published: (2023)

Evaluating Adversarial Robustness of Concept Representations in Sparse Autoencoders
by: Li, Aaron J., et al.
Published: (2025)

Jacobian Sparse Autoencoders: Sparsify Computations, Not Just Activations
by: Farnik, Lucy, et al.
Published: (2025)

Efficient Federated Finetuning of Tiny Transformers with Resource-Constrained Devices
by: Pfeiffer, Kilian, et al.
Published: (2024)

Towards Understanding the Robustness of Sparse Autoencoders
by: Saiyed, Ahson, et al.
Published: (2026)

Sparse Computations in Deep Learning Inference
by: Tasou, Ioanna, et al.
Published: (2025)

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
by: Del Pia, Alberto, et al.
Published: (2025)