Exploiting different representations, or views, of the same object for better clustering has become very popular these days, which is conventionally called multi-view clustering. Generally, it is essential to measure the importance of each individual view, due to some noises, or inherent capacities in description. Many…
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.
168,742 papers · 148 categories
Trend · papers per month
47 results for “weight-learning”
A new DP algorithm for weighted ERM protects sensitive data in predictive models.
problem Protecting sensitive personal information in predictive models trained via ERM.
method Proposes the first differentially private algorithm for weighted ERM with formal privacy guarantees.
result Demonstrates strong DP guarantees while maintaining robust performance in real-world data.
Proposes a method to estimate personalized treatments from high-dimensional data.
problem Estimating individualized treatment regimes (ITRs) from high-dimensional covariates.
method Directly targets the contrast between potential outcomes, using dimension-reduced outcome-weighted learning.
result Achieves universal consistency, converging to the Bayes risk under mild conditions.
PROWL uses robust reward estimates to improve ITR selection.
problem Reward uncertainty in ITR estimation leads to inflated performance.
method PAC-Bayesian framework with reward uncertainty certificates.
result PROWL achieves better robust treatment regime estimation.
OTSS learns personalized decision weights from logged decisions and outputs.
problem Learning context-specific decision weights from logged decisions and outputs.
method Output-targeted soft-segmentation model that deploys personalized decision-ready weight vectors.
result OTSS achieves the lowest mean regret in benchmark settings.
New findings show tool-augmented models can recall unlimited facts, outperforming purely memorized models.
problem Limitations of purely memorized models in recalling large amounts of factual information.
method Demonstrated the benefits of in-tool learning (external retrieval) over in-weight learning (memorization) for factual recall.
result Proved that tool-use enables unbounded factual recall via a simple and efficient circuit construction.
Graph coloring involves assigning colors to the vertices of a graph such that two vertices linked by an edge receive different colors. Graph coloring problems are general models that are very useful to formulate many relevant applications and, however, are computationally difficult. In this work, a general population-b…
Unified minimax value interval for off-policy evaluation and optimization.
problem Overcoming the exponential variance in off-policy evaluation and policy optimization.
method Unified minimax value interval using marginalized importance weights.
result Unified value interval with double robustness, valid when either value-function or importance-weight class is well specified.
Develops methods for near-optimal personalized treatment recommendations.
problem Assigning optimal treatments to patients based on individual characteristics.
method Outcome weighted learning framework to estimate near-optimal alternative individualized treatment recommendations (A-ITR).
result Consistency of proposed methods and upper bound for risk between optimal and estimated recommendations.
New learning process for neural classifiers simplifies decision weights.
problem Training decision layer weights in neural classifiers.
method Choosing appropriate loss functions and solving constrained optimization problems.
result A new learning process for pre-decision weights that is simple and effective.
We unify recent neural approaches to one-shot learning with older ideas of associative memory in a model for metalearning. Our model learns jointly to represent data and to bind class labels to representations in a single shot. It builds representations via slow weights, learned across tasks through SGD, while fast wei…
We formulate learning of a binary autoencoder as a biconvex optimization problem which learns from the pairwise correlations between encoded and decoded bits. Among all possible algorithms that use this information, ours finds the autoencoder that reconstructs its inputs with worst-case optimal loss. The optimal decode…
Real-world machine learning applications often have complex test metrics, and may have training and test data that are not identically distributed. Motivated by known connections between complex test metrics and cost-weighted learning, we propose addressing these issues by using a weighted loss function with a standard…
One popular generative model that has high-quality results is the Generative Adversarial Networks(GAN). This type of architecture consists of two separate networks that play against each other. The generator creates an output from the input noise that is given to it. The discriminator has the task of determining if the…
MAT uses attention mechanism for molecule property prediction.
problem Designing a competitive neural network for molecule property prediction.
method Augmented attention mechanism using inter-atomic distances and molecular graph structure.
result MAT achieves state-of-the-art performance on diverse molecular prediction tasks.
Continual Learning is a learning paradigm where learning systems are trained with sequential or streaming tasks. Two notable directions among the recent advances in continual learning with neural networks are () variational Bayes based regularization by learning priors from previous tasks, and, () learning the s…
Structured sparsity has recently emerged in statistics, machine learning and signal processing as a promising paradigm for learning in high-dimensional settings. All existing methods for learning under the assumption of structured sparsity rely on prior knowledge on how to weight (or how to penalize) individual subsets…
Markov networks (MNs) are a powerful way to compactly represent a joint probability distribution, but most MN structure learning methods are very slow, due to the high cost of evaluating candidates structures. Dependency networks (DNs) represent a probability distribution as a set of conditional probability distributio…
Multi-view clustering is an important approach to analyze multi-view data in an unsupervised way. Among various methods, the multi-view subspace clustering approach has gained increasing attention due to its encouraging performance. Basically, it integrates multi-view information into graphs, which are then fed into sp…
New method selects best HTE estimator without ground-truth treatment effects.
problem Selecting best HTE estimator from multiple candidates.
method Cross-fitted, exponentially weighted test statistic with two-way sample splitting.
result Empirically, reliable error control and reduced false selections.
Inspired by recent successes of deep learning in computer vision, we propose a novel framework for encoding time series as different types of images, namely, Gramian Angular Summation/Difference Fields (GASF/GADF) and Markov Transition Fields (MTF). This enables the use of techniques from computer vision for time serie…
Algorithm learns which weights to share in deep multi-task learning.
problem Difficulty in deciding which weights to share between tasks in deep learning models.
method Combines natural evolution strategy and stochastic gradient descent to learn optimal weight sharing.
result Task-specific networks achieve lower test errors than existing methods on multi-task learning datasets.
This paper presents a novel multitask multiple kernel learning framework that efficiently learns the kernel weights leveraging the relationship across multiple tasks. The idea is to automatically infer this task relationship in the \textit{RKHS} space corresponding to the given base kernels. The problem is formulated a…
As a consequence of the strong and usually violated conditional independence assumption (CIA) of naive Bayes (NB) classifier, the performance of NB becomes less and less favorable compared to sophisticated classifiers when the sample size increases. We learn from this phenomenon that when the size of the training data …
Parametric UMAP learns a mapping from data to embeddings.
problem Representing and learning from structured data.
method Parametric optimization over neural network weights for UMAP.
result Parametric UMAP performs comparably to non-parametric UMAP with faster online embeddings.
Meta-analysis improves personalized treatment rules across multiple sites.
problem Lack of generalizability in learning individualized treatment rules across different medical sites.
method Developed a method for individual-level meta-analysis of ITRs, borrowing sign-coherency information between sites.
result Jointly learned site-specific ITRs with improved generalizability.
FONT clusters patients across health systems with privacy and efficiency.
problem Challenges in multi-site cluster analysis due to data-sharing restrictions.
method Federated One-shot Ensemble Clustering (FONT) algorithm that requires only a single round of communication and exchanges only fitted model parameters and class labels.
result FONT improves consistency of patient clusters across sites compared to locally fitted clusters.
Neural networks with learned biases can approximate any function.
problem Whether neural networks with only learned biases can approximate any continuous function.
method Theoretical and numerical analysis of random weights and learned biases in neural networks.
result Feedforward and recurrent neural networks with random weights can approximate any continuous function and dynamical systems.
This paper tackles continuous covariate shift by adaptively training predictors.
problem Continuous covariate shift where input distributions change over time.
method Online density ratio estimation method to adaptively train predictors.
result Excess risk guarantee for the predictor through dynamic regret bound.
The International Classification of Functioning, Disability, and Health for Children and Youth (ICF-CY) is a scaffold for designating and systematizing data on functioning and disability. It offers a standard semantic and a theoretical foundation for the demarcation and extent of wellbeing and infirmity. The multidimen…
Direct learning framework for integrating multi-source causal data.
problem Conditional average treatment effects inference from heterogeneous data.
method Direct learning framework, double robustness, causal information-aware weighting function.
result Effective causal data fusion in both homogeneous and heterogeneous scenarios.
Localization of chest pathologies in chest X-ray images is a challenging task because of their varying sizes and appearances. We propose a novel weakly supervised method to localize chest pathologies using class aware deep multiscale feature learning. Our method leverages intermediate feature maps from CNN layers at di…
The field of precision medicine aims to tailor treatment based on patient-specific factors in a reproducible way. To this end, estimating an optimal individualized treatment regime (ITR) that recommends treatment decisions based on patient characteristics to maximize the mean of a pre-specified outcome is of particular…
Generally speaking, the goal of constructive learning could be seen as, given an example set of structured objects, to generate novel objects with similar properties. From a statistical-relational learning (SRL) viewpoint, the task can be interpreted as a constraint satisfaction problem, i.e. the generated objects must…
Grade prediction for future courses not yet taken by students is important as it can help them and their advisers during the process of course selection as well as for designing personalized degree plans and modifying them based on their performance. One of the successful approaches for accurately predicting a student'…
Deep networks converge in direction, with implications for predictions and margins.
problem Understanding convergence and alignment in deep learning networks.
method Developed a theory of unbounded nonsmooth Kurdyka-Łojasiewicz inequalities for functions definable in an o-minimal structure.
result Network weights, predictions, training errors, and margin distribution converge in direction and align with gradient flow.
The worst-case training principle that minimizes the maximal adversarial loss, also known as adversarial training (AT), has shown to be a state-of-the-art approach for enhancing adversarial robustness. Nevertheless, min-max optimization beyond the purpose of AT has not been rigorously explored in the adversarial contex…
Learning a set of tasks over time, also known as continual learning (CL), is one of the most challenging problems in artificial intelligence. While recent approaches achieve some degree of CL in deep neural networks, they either (1) grow the network parameters linearly with the number of tasks, (2) require storing trai…
New algorithm shows neural networks can learn without full backpropagation.
problem Stochastic gradient descent with backpropagation is non-biologically plausible.
method Random and fixed backpropagation weights in a feedback alignment algorithm.
result Error converges to zero exponentially fast in overparameterized networks.
New method finds compact strong lottery tickets in partially frozen networks.
problem Finding compact strong lottery tickets in randomly pruned networks.
method Freezing a random subset of initial weights in a partially frozen network.
result Better accuracy and compression achieved with frozen networks.
Proposes a new method for dynamic treatment regimes that improves sample efficiency and stability.
problem Challenges in estimating optimal treatments for individuals with dynamic decision-making stages.
method Focuses on prioritizing alignment between observed and optimal treatment trajectories across decision stages.
result Improves sample efficiency and stability of IPWE-based methods by relaxing the alignment requirement.
The complexity of human cancer often results in significant heterogeneity in response to treatment. Precision medicine offers potential to improve patient outcomes by leveraging this heterogeneity. Individualized treatment rules (ITRs) formalize precision medicine as maps from the patient covariate space into the space…
The paper explores when to prioritize easy or hard samples in learning tasks.
problem Determining the optimal order of learning easy or hard samples.
method Theoretical analyses and experiments were conducted to propose and validate four priority modes.
result Four priority modes (easy-first, hard-first, medium-first, two-ends-first) can be flexibly applied.
Proposes new models to predict student grades more accurately.
problem Accurately predicting future grades considering prior and concurrent courses.
method Context-aware, non-linear, and neural attentive models.
result Models outperform existing methods in predicting student grades.
New method speeds up uncertainty estimation for large datasets in causal inference.
problem Computational infeasibility of bootstrap-based uncertainty quantification for large datasets.
method Extends cBLB algorithm to kernel methods, combining subsampling and resampling.
result Achieves computational scalability with nominal coverage.
Paper explores how uncertainty quantification improves Transformer's in-context learning ability.
problem Understanding and quantifying in-context learning ability of Transformers.
method Revisit linear regression tasks with bi-objective prediction (conditional expectation and variance).
result Trained Transformers achieve near Bayes-optimum performance, suggesting use of training distribution.
Paper explores using bi-fidelity data to train neural networks for uncertainty quantification.
problem Training neural networks requires large amounts of data, which may not be available for computationally expensive systems.
method Transfer learning techniques using high- and low-fidelity models, including standard transfer and bi-fidelity weighted learning.
result Bi-fidelity transfer learning improves accuracy over standard training approaches.