SAFLe solves federated learning's trade-off between non-linearity and scalability.
problem Federated Learning's high communication overhead and performance collapse on non-IID data.
method SAFLe introduces a structured head of bucketed features and sparse, grouped embeddings, mathematically equivalent to a high-dimensional linear regression.
result SAFLe achieves a new state-of-the-art in analytic FL, outperforming linear AFL and multi-round DeepAFL.
DiPCA algorithm improves scalability and solution quality for time-dependent data.
problem Analyzing time-dependent multivariate data with dynamic latent variables.
method Solves a large-scale, dense, nonconvex NLP using a scalable decomposition algorithm.
result The decomposition algorithm is a specialized coordinate maximization algorithm, explaining its performance and guiding improvements.
The paper discusses scalable learning for wireless data-driven systems.
problem Expanding data volume and model complexity limit centralized learning solutions.
method Discusses scalable architecture and local learning strategies.
result Promising research directions in scalable data-driven wireless communications.
New method efficiently computes gradients for stochastic differential equations.
problem Computing gradients for stochastic differential equations efficiently.
method Generalized adjoint sensitivity method to stochastic differential equations.
result Time-efficient and memory-efficient computation of gradients with high-order solvers.
Proposes a scalable algorithm for large-scale probabilistic tensor analysis.
problem Leveraging time constraints to capture evolving tensor data.
method Introduces a new tensor data split strategy and an efficient algorithm for stochastic Alternating Direction Method of Multipliers.
result Demonstrates that P2T2F is a highly effective and efficiently scalable algorithm. SAIF efficiently selects features for sparse learning problems.
problem Efficiently selecting features in high-dimensional sparse learning problems.
method Incremental feature selection starting from a small set of features, with convergence guarantees.
result SAIF achieves superior or comparable efficiency and high scalability with a safe convergence guarantee.
NHC learns scalable algorithmic solutions from diverse tasks.
problem Neural networks struggle to learn algorithmic strategies.
method Memory-augmented network with abstraction mechanism and evolutionary training.
result Reliable learning of robust and scalable algorithmic solutions.
MLPerf benchmarks ML training to drive performance improvements.
problem Unique challenges in ML training benchmarks.
method Developed MLPerf to overcome ML training's specific challenges.
result Quantitatively evaluated MLPerf's effectiveness.
SPARC improves continual learning with minimal memory and computational overhead.
problem Efficient continual learning for deep neural networks.
method Combines task-specific working memories and task-agnostic semantic memory.
result Significantly reduces parameter usage (6% of full-model surrogates) while maintaining performance.
Proposes a variational framework for fair clustering.
problem Ensuring fairness in clustering algorithms.
method Integrates fairness term with clustering objectives, using variational approach.
result Derives tight upper bound for optimization, enabling scalable solution.
Big Data classifiers perform similarly to Small Data classifiers, suggesting scalability tradeoffs.
problem Comparing Big Data classifiers to Small Data classifiers for performance and scalability.
method Empirical study comparing Big Data classifiers to Small Data classifiers.
result Big Data classifiers are slightly inferior but catching up with Small Data classifiers.
Efficient federated algorithm for calculating transportation barycenter.
problem Efficiently calculating the free-support transportation barycenter in a federated setting.
method Single-loop dual decomposition algorithm that uses only aggregated information.
result Significantly scalable and low-complexity algorithm for federated computation.
A scalable MARL algorithm using local rewards for cooperative multi-agent learning.
problem Scalability issues in cooperative multi-agent reinforcement learning due to large state and action spaces.
method LOMAQ algorithm incorporating local rewards in centralized training and decentralized execution.
result LOMAQ scales well compared to other methods, improving performance and convergence speed.
Scalable solution for interpreting complex data-driven models.
problem Interpreting black box models and handling large datasets.
method Streaming neighborhood graph construction, topology computation, and data aggregation.
result Interactive exploration of high-dimensional data.
SWALP averages SGD iterates for low-precision training, improving scalability and performance.
problem Improving scalability and performance in low-precision training.
method Averages low-precision SGD iterates with a modified learning rate schedule.
result SWALP matches full-precision SGD performance with 8-bit quantization and converges to optimal solutions.
Federated Learning system for mobile devices.
problem Training models on decentralized data.
method High-level design of a scalable Federated Learning system.
result Solutions to challenges in federated learning.
This dissertation advances scalable Gaussian processes using iterative methods and pathwise conditioning.
problem The classical Gaussian process formulation is not scalable for large datasets and modern hardware.
method Combining iterative methods and pathwise conditioning to improve scalability.
result Significantly reduced memory requirements and facilitated application to larger datasets.
New algorithm optimizes neural network architecture efficiently.
problem Optimizing neural network architecture with minimal layers and cost.
method Greedy Search for Neural Network Architecture.
result Our method outperforms state-of-the-art algorithms in terms of performance and time.
CorePPR combines PageRank and CoreRank for scalable GNNs.
problem Expensive message passing in GNNs for large graphs.
method Learnable convex combination of approximate PPR and CoreRank, dynamic node selection.
result CorePPR outperforms PPRGo on large graphs.
Multi-objective optimization (MOO) is a well-studied problem for several important recommendation problems. While multiple approaches have been proposed, in this work, we focus on using constrained optimization formulations (e.g., quadratic and linear programs) to formulate and solve MOO problems. This approach can be …
Bayesian non-linear matrix completion tackles large, sparse data.
problem Predict missing elements in large, sparsely observed matrices.
method Bayesian Gaussian process latent variable models with data-parallel distributed computation.
result Scalable Bayesian non-linear matrix completion outperforms linear methods.
A scalable gradient-based framework for sparse portfolio selection.
problem Sparse minimum-variance portfolio selection with cardinality constraint.
method Gradient-based optimization with Boolean relaxation and tunable parameter.
result Matches commercial solvers in most instances, differing by a few assets with negligible error in portfolio variance.
Sparse DNNs face scalability issues; MIT/IEEE/Amazon challenge analyzes best solutions.
problem Scalability issues in Sparse Deep Neural Networks (DNNs).
method Mathematically defined DNN inference computation, community submissions from various fields.
result Sparse DNN execution time, TmDNN, is strongly dependent on the number of operations, Nmop. SG-PALM learns interpretable tensor models for high-dimensional data.
problem Learning interpretable tensor models for high-dimensional data.
method SG-PALM combines Sylvester generative model and fast proximal alternating linearized minimization.
result SG-PALM converges linearly to global optimum and scales to high dimensions.
This paper reviews recent advances in Gaussian process regression methods.
problem Handling uncertainties and scalability in large-scale systems with sparse data.
method Factorised Gaussian process methods, including hierarchical off-diagonal low-rank approximation and GP with Kronecker structures.
result These methods provide scalable solutions with inherent uncertainty assessment.
Proposes a mathematical model for safe and scalable self-driving cars.
problem Ensuring safety and scalability in self-driving cars.
method Introduces Responsibility-Sensitive Safety (RSS) model and scalable design.
result Proposes a mathematical model for safety assurance and scalable design.
A-NeSI scales approximate inference for probabilistic neurosymbolic learning.
problem Combining neural networks with symbolic reasoning for scalable inference.
method A-NeSI: a new framework for PNL using neural networks for approximate inference.
result A-NeSI achieves scalable approximate inference without semantic changes.
Decentralized Gaussian processes for multi-agent learning.
problem Training and prediction in multi-agent systems.
method Decentralized ADMM for GP hyper-parameter training and iterative consensus for prediction.
result Subset of agents can perform predictions using covariance-based nearest neighbor selection.
New approach uses dynamic programming to efficiently discover failures in autonomous vehicle simulations.
problem Efficiently discovering rare failure events in autonomous vehicle simulations.
method Approximate dynamic programming and scene decomposition to estimate failure distribution.
result Increased number of failures discovered compared to baseline approaches.
DBKs enable scalable GPs with tractable inference for large datasets.
problem Scaling Gaussian processes to large and complex datasets while maintaining tractable inference.
method DBKs constructed from neural-network-parameterized basis functions with explicit low-rank structure, enabling linear-complexity inference.
result DBKs provide a unified perspective and improve predictive accuracy, uncertainty quantification, and computational efficiency.
New method solves large-scale QCPs using low-discrepancy sequences.
problem Solving large-scale Quadratically Constrained Quadratic Programs (QCQP).
method Transforming QCQP into a linear problem via low-discrepancy sampling.
result Approximate solutions converge to true solutions and have finite sample error bounds.
Bayesian deep learning improves accuracy and calibration without sacrificing scalability.
problem Bayesian inference's potential for deep neural networks.
method Marginalization over optimization, using neural networks' inherent structure and inductive biases.
result Improvements in accuracy and calibration compared to standard training methods.
A scalable framework optimizes multi-asset portfolios with constraints.
problem Optimizing multi-asset portfolios with inequality constraints.
method Integrates neural policies with Pontryagin's Maximum Principle, enforcing feasibility via log-barrier regularization.
result Recover KKT-optimal policies in high-dimensional problems without violating constraints.
Develops probabilistic safety regions for scalable classifiers.
problem Minimizing misclassification errors in supervised classification.
method Introduces probabilistic safety regions and scalable classifiers.
result Probabilistic certifications for classifier performance.
NanoFlow reduces parameter complexity in normalizing flows.
problem Efficient parameter complexity in flow-based models.
method Single neural density estimator with flow indication embedding.
result Sublinear parameter complexity achieved.
EASTER improves OCR efficiency and scalability.
problem Efficient and scalable Optical Character Recognition (OCR) for machine printed and handwritten text.
method 1-D convolutional layers without recurrence, parallel training, synthetic dataset generation.
result EASTER achieves comparable performance to complex RNN models with less data and outperforms them on benchmark datasets.
No-trick kernel adaptive filtering uses deterministic features for scalability and robustness.
problem Scalability issues in kernel methods for large datasets.
method Deterministic feature-map construction using polynomial-exact solutions.
result Deterministic features outperform random Fourier features in performance and scalability.
NeuralProphet improves forecast accuracy by 55-92% for short-term forecasts.
problem Challenges in explainable, scalable forecasting for business decisions.
method Hybrid framework combining classical methods and deep learning, with auto-regression and covariate modules.
result NeuralProphet outperforms Prophet on real-world datasets and short-term forecasts.
PSI-KT improves KT accuracy and interpretability in learning materials.
problem Optimizing learning materials selection and timing for understanding and retention.
method Hierarchical generative approach using Bayesian inference.
result Superior multi-step predictive accuracy and scalable inference.
BO method improved by density-ratio estimation for better efficiency and scalability.
problem Limitations in Bayesian optimization due to analytical tractability of predictive models.
method Reformulated Bayesian optimization by casting expected improvement as a binary classification problem.
result Improved efficiency and scalability of Bayesian optimization.
New algorithm detects changes quickly without knowing parameters, near optimally.
problem Quickest change detection with unknown parameters.
method Leverages theoretical asymptotic properties to derive a scalable approximate algorithm with near optimal performance.
result Detects changes in constant complexity with near optimal performance.
Paper proposes scalable GP framework for cost-efficient wireless traffic prediction.
problem Wireless traffic prediction for C-RANs to improve spectrum and energy efficiency.
method Scalable Gaussian process framework with ADMM for parallel hyper-parameter optimization and cross-validation based optimal fusion strategy.
result Proposed scalable GP model outperforms state-of-the-art approaches in wireless traffic prediction.
DAC improves associative classification for very large datasets with high scalability and quality.
problem Handling large datasets with many categorical features.
method DAC uses ensemble learning, parallel processing, and pruning techniques.
result DAC outperforms state-of-the-art solutions in prediction quality and execution time.
LargeMvC-Net improves scalability of multi-view clustering.
problem Scalability issues in multi-view clustering.
method Deep unfolding of multi-view clustering into a network architecture with three modules.
result LargeMvC-Net consistently outperforms state-of-the-art methods in scalability and effectiveness.
Paper tackles DR problem with scalable signature-based approach.
problem Memory and computation cost issues in DR solutions.
method Signature-based features, novel distance approximator.
result Proposes scalable DR solution with reduced estimation uncertainty.
Bayesian method predicts individual and crowd preferences from small data.
problem Difficult to predict preferences from limited personal data and noisy labels.
method Combines matrix factorization with Gaussian processes for scalable inference.
result Method predicts preferences for new users and items not in training set.
Paper introduces scalable neural architecture for solving NP-hard problems.
problem Solving NP-hard reasoning problems from natural inputs.
method Scalable neural architecture and loss function for discrete Graphical Models.
result Empirically shows efficient learning of NP-hard problems.
New algorithm finds best subset in high-dimensional data models.
problem Finding the best subset of predictors in high-dimensional data models.
method Proposes a scalable algorithm using a generalized information criterion.
result Directly proves consistency and oracle property for the best-subset selection.