PCGs encompass a broader range of neural networks.
problem Understanding the broader scope of neural network models.
method Proving PCGs as a superset of feedforward neural networks.
result PCGs represent a wider class of neural network models.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,051 papers · 148 categories
Trend · papers per month
18 results for “PCG”
PCGS-TF uses a Transformer to adaptively control expert switching in non-stationary environments.
problem Static regret is insufficient for strictly online prediction in non-stationary settings.
method Policy-Controlled Generalized Share (PCGS) with a Transformer as an update controller.
result PCGS-TF achieves the lowest dynamic regret in non-stationary families and expert pools.
Introduces PCG for better counterfactual explanations in vision models.
problem Ambiguity in latent-space optimization methods for counterfactual explanations.
method Constructs counterfactuals by tracing geodesics under a perceptually Riemannian metric.
result PCG outperforms baselines and reveals hidden failure modes.
Novel method segments heart sound signals using LSTMs with attention.
problem Heart sound segmentation for diagnostic applications.
method Bidirectional LSTMs with attention mechanisms.
result State-of-the-art performance on multiple benchmarks.
Class Augmented Semi-Supervised Learning for Practical Clinical Analytics on Physiological Signalsphysics.med-ph
Semi-supervised learning method augments minority class examples for robust anomaly detection in clinical signals.
problem Class imbalance in minority class instances impairs robustness of clinical analytics solutions.
method Intelligent augmentation of minority class examples to balance class distribution and construct a smooth decision boundary.
result The proposed method outperforms state-of-the-art algorithms in anomaly detection for clinical signals.
A new method reduces the cost of solving large-scale linear models.
problem Solving large-scale linear statistical models efficiently.
method Sequential Preconditioned Conjugate Gradient Method (SPCG).
result SPCG achieves OLS prediction accuracy with fewer iterations and less time.
Paper classifies heart sound recordings as normal or abnormal.
problem Classifying normal/abnormal heart sound recordings.
method Four steps: preprocessing, feature extraction, training, validation. Back propagation neural network used.
result Optimal threshold determined for distinguishing normal and abnormal.
A new method for uplift modeling using learning-to-rank techniques.
problem Improving customer targeting in marketing and retention.
method Unified formalization of uplift measures, learning-to-rank with PCG metric, LambdaMART optimization.
result Improved results compared to standard learning-to-rank metrics and state-of-the-art uplift modeling.
Nested Chinese Restaurant Process (nCRP) topic models are powerful nonparametric Bayesian methods to extract a topic hierarchy from a given text corpus, where the hierarchical structure is automatically determined by the data. Hierarchical Latent Dirichlet Allocation (hLDA) is a popular instance of nCRP topic models. H…
In this article, we propose a novel technique for classification of the Murmurs in heart sound. We introduce a novel deep neural network architecture using parallel combination of the Recurrent Neural Network (RNN) based Bidirectional Long Short-Term Memory (BiLSTM) & Convolutional Neural Network (CNN) to learn visual …
In this paper, a Wide Learning architecture is proposed that attempts to automate the feature engineering portion of the machine learning (ML) pipeline. Feature engineering is widely considered as the most time consuming and expert knowledge demanding portion of any ML task. The proposed feature recommendation approach…
Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Modelsstat.ML
A new method for estimating large-scale linear models with improved precision.
problem Estimating large-scale linear statistical models efficiently.
method Sequential Least-Squares Estimators with Fast Randomized Sketching (SLSE-FRS), integrating Sketch-and-Solve and Iterative-Sketching methods.
result SLSE-FRS produces high-precision estimators, outperforming state-of-the-art methods.
TOAD-GAN generates coherent game levels from a single example.
problem Creating game levels from a single example.
method Token-based Procedural Content Generation (PCG) using SinGAN architecture.
result Achieves state-of-the-art results in generating coherent levels of similar style.
Procedural content generation via machine learning (PCGML) is typically framed as the task of fitting a generative model to full-scale examples of a desired content distribution. This approach presents a fundamental tension: the more design effort expended to produce detailed training examples for shaping a generator, …
Proposes STRON method for large-scale machine learning problems.
problem Large-scale machine learning problems.
method Stochastic Trust Region Inexact Newton (STRON) method using CG to solve trust region subproblem with progressive subsampling.
result Empirical results show efficacy of STRON method.
Energy-efficient sampling for machine learning using magnetic tunnel junctions.
problem Costly and inefficient random sampling in machine learning.
method Energy-efficient algorithm using stochastic magnetic tunnel junctions for uniform Float16 sampling.
result Higher energy efficiency than state-of-the-art algorithms, with a minimum factor of 9721.
A new ML method speeds up PDE simulations without needing classical training.
problem Accelerating transient PDE simulations using machine learning.
method Online-learned preconditioners using a bandit algorithm.
result One-shot acceleration of PDE simulations.
ASkotch solves large-scale KRR faster and better than existing methods.
problem Challenges in scaling full Kernel Ridge Regression (KRR) to large datasets.
method ASkotch: A scalable, accelerated, iterative method for full KRR.
result ASkotch provides better solutions faster than state-of-the-art solvers for full and inducing points KRR.