We study the relationship between the notions of differentially private learning and online learning in games. Several recent works have shown that differentially private learning implies online learning, but an open problem of Neel, Roth, and Wu \cite{NeelAaronRoth2018} asks whether this implication is {\it efficient}…
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,657 papers · 148 categories
Trend · papers per month
48 results for “efficient learning”
Study efficient learning of robust halfspaces with noise.
problem Learning robust halfspaces in the presence of adversarial perturbations and random label noise.
method Provides conditions for robust learnability and a simple algorithm for any ℓ_p perturbation.
result Simple computationally efficient algorithm for robust learning with random label noise.
Improved sample efficiency in reinforcement learning with deep Gaussian processes.
problem Efficiently learn to control actions with limited interaction data.
method Deep Gaussian processes that simulate dynamics with depth and prior knowledge.
result Significantly improved early sample efficiency across various tasks, including half-cheetah control.
FiT combines transfer and meta-learning for efficient few-shot image classification.
problem Few-shot image classification in personalized and federated learning settings.
method Combines transfer learning and meta-learning with fixed pretrained backbones and fine-tuned FiLM adapter layers.
result Achieves state-of-the-art accuracy on VTAB-1k benchmark with fewer than 1% of updateable parameters.
EP-learning framework improves causal contrast estimation efficiency.
problem Estimating heterogeneous causal contrasts efficiently and stably.
method EP-learning framework combining T-learning and DR-learning.
result EP-learners are oracle-efficient and outperform competitors.
New findings show limitations in converting private learning to online learning efficiently.
problem Limitations in converting private learning to online learning efficiently.
method Assuming one-way functions, we show an efficient conversion from pure-private learners to online learners is impossible.
result Efficient conversion from pure-private learners to online learners is impossible under certain assumptions.
Extended analysis of Q-learning's efficiency, matching optimal regret.
problem Theoretical guarantees of Q-learning's efficiency and optimal regret.
method Survey of related research, detailed proof reasoning.
result Q-learning with UCB exploration achieves sample efficiency matching optimal regret.
Probabilistic active meta-learning improves data efficiency in robotics.
problem Data-efficient learning in robotics where data collection is expensive.
method Conceptualizing meta-learning with a probabilistic latent variable model for sequential task selection.
result Improves data efficiency compared to baselines on simulated robotic experiments.
Efficiently learns halfspaces with malicious noise, near-optimal label complexity.
problem Learning -sparse halfspaces under malicious label noise.
method Active learning algorithm with instance reweighting and empirical risk minimization.
result Near-optimal label complexity of and noise tolerance .
Examines learning efficiency in neural networks and related models.
problem Analyzing efficiency in deep learning models with singular learning coefficients.
method Examined learning coefficients in neural networks and three-layer neural networks with ReLU units.
result Extended results to include Softmax function, providing a broader understanding of learning efficiency.
This work improves sample efficiency in meta-learning for nonlinear tasks.
problem Learning complex tasks efficiently with limited data.
method Subspace-based representations for nonlinear tasks.
result Subspace-based representations can be learned efficiently and improve future task performance.
Efficiently scales continuous kernels with sparse Fourier domain learning.
problem High computational and memory demands, spectral bias in continuous kernels.
method Sparse learning in the Fourier domain.
result Efficient scaling of continuous kernels, reduced computational and memory requirements, mitigated spectral bias.
In this paper we consider self-supervised representation learning to improve sample efficiency in reinforcement learning (RL). We propose a forward prediction objective for simultaneously learning embeddings of states and action sequences. These embeddings capture the structure of the environment's dynamics, enabling e…
Neural network approximates weakly efficient frontier of convex vector optimization problems.
problem Approximating the weakly efficient frontier of convex vector optimization problems.
method Designing a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition.
result The proposed algorithm effectively approximates the true weakly efficient frontier of CVOPs, even for large problems.
Bayesian model for energy-efficient EV navigation.
problem Limited battery capacity in electric vehicles.
method Bayesian modeling and online learning framework with exploration strategies.
result Established rigorous regret bounds for Thompson Sampling.
Meta-learning algorithms are studied for their data efficiency in personalized federated learning.
problem Data efficiency in meta-learning algorithms.
method Algorithmic stability techniques to derive bounds on transfer risk and a new evaluation framework.
result Different meta-learning methods require varying amounts of supervision for effective generalization.
Oracle-efficient algorithms for online learning with smoothed and hint-adversaries.
problem Online learning with beyond worst-case adversaries.
method Oracle-efficient algorithms for two settings: smoothed analysis and -hint transductive learning.
result Oracle-efficient regret bounds for learning real-valued and binary-valued functions.
Many theories of deep learning have shown that a deep network can require dramatically fewer resources to represent a given function compared to a shallow network. But a question remains: can these efficient representations be learned using current deep learning techniques? In this work, we test whether standard deep l…
Catalyst.RL accelerates RL research with efficient training.
problem Efficient reinforcement learning training in complex environments.
method Open-source PyTorch framework with distributed training and RL algorithms.
result Catalyst.RL achieved 2nd place in a computationally expensive RL challenge.
This research develops an efficient reinforcement learning method for undercomplete POMDPs.
problem Learning undercomplete Partially Observable Markov Decision Processes (POMDPs) is computationally hard.
method OOM-UCB algorithm for episodic finite undercomplete POMDPs.
result Achieves optimal sample complexity of for finding an -optimal policy.
Efficient exploration for automatic subgoal discovery is a challenging problem in Hierarchical Reinforcement Learning (HRL). In this paper, we show that intrinsic motivation learning increases the efficiency of exploration, leading to successful subgoal discovery. We introduce a model-free subgoal discovery method base…
KalMamba improves RL efficiency with probabilistic SSMs.
problem Efficiency in learning and inference for probabilistic SSMs in RL.
method Combines Mamba's scalability with Kalman filtering for efficient probabilistic SSMs.
result KalMamba outperforms state-of-the-art SSMs in RL, especially on longer sequences.
NNs can learn efficient algorithms for certain problems.
problem Learning efficient algorithms for specific problems.
method Recurrent Convolutional Neural Networks (RCNNs) that learn efficiently.
result RCNNs can learn as well as efficient algorithms described by a constant-sized program.
Recent work on policy learning from observational data has highlighted the importance of efficient policy evaluation and has proposed reductions to weighted (cost-sensitive) classification. But, efficient policy evaluation need not yield efficient estimation of policy parameters. We consider the estimation problem give…
Paper tackles efficient risk estimation under dataset shift conditions.
problem Limited data from target population; auxiliary data available.
method Semiparametric efficiency theory; efficient and multiply robust estimators.
result Developed estimators for various dataset shift conditions.
On Practical Reinforcement Learning: Provable Robustness, Scalability, and Statistical Efficiencycs.LG
This thesis improves practical reinforcement learning methods with robustness, scalability, and efficiency.
problem Improving reinforcement learning methods for practical applications.
method Analyzes and develops robust, scalable, and efficient reinforcement learning algorithms.
result Proves the efficiency and robustness of new RL methods.
Communication Efficient Distributed Learning with Censored, Quantized, and Generalized Group ADMMcs.LG
Efficient decentralized learning framework reduces communication costs.
problem Efficiently solve optimization problems in distributed learning networks.
method Censored and Quantized Generalized GADMM (CQ-GGADMM) framework.
result Achieves linear convergence rate under strong convexity assumptions.
We compare communication efficiencies of two compelling distributed machine learning approaches of split learning and federated learning. We show useful settings under which each method outperforms the other in terms of communication efficiency. We consider various practical scenarios of distributed learning setup and …
Data-efficient PDE operator learning without expensive simulations.
problem Expensive numerical PDE solutions limit data efficiency in machine learning.
method Unsupervised pretraining and in-context learning.
result Highly data-efficient and more generalizable than conventional models.
Efficient strategies for online learning against bandit algorithms solve minimax problems.
problem Solving min-max problems in convex-linear settings with empirical distributions.
method Designing online learning algorithms that play against bandit algorithms, leveraging properties of the set of empirical distributions.
result High-probability convergence guarantees to minimax values for a specific family of sets.
CCLF: A Contrastive-Curiosity-Driven Learning Framework for Sample-Efficient Reinforcement Learningcs.LG
CCLF improves sample efficiency in RL by prioritizing informative samples.
problem Learning from high-dimensional observations is challenging and unstable.
method Contrastive-Curiosity-Driven Learning Framework (CCLF) that prioritizes informative samples.
result CCLF improves sample efficiency and learning performance in RL.
Efficiently learns DAG structures without cycles.
problem Learning DAG structures efficiently with constraints.
method Proposes DAG-NoCurl, a two-step algorithm to find and project acyclic graphs.
result Significantly improves efficiency over existing methods, often by more than one order of magnitude.
Meta-learning algorithm improves AI efficiency by teaching itself.
problem Overcoming meta-optimization challenges in AI learning.
method Bootstraps a target from the meta-learner and optimizes the meta-learner by minimizing distance under a chosen metric.
result Achieves state-of-the-art performance on Atari ALE benchmark and demonstrates efficiency gains in multi-task learning.
ReaPER improves learning efficiency by prioritizing reliable experiences.
problem Inefficient sampling of past experiences in reinforcement learning.
method Introducing a novel measure of reliability to prioritize experiences in PER.
result ReaPER outperforms PER in various environments, including Atari-10.
The paper examines efficient algorithms for linear regression over resource-limited networks.
problem Efficient communication in distributed learning over resource-limited networks.
method Developed algorithms for communication-efficient learning of linear regression tasks.
result The algorithms enable a tradeoff between communication and learning with theoretical performance guarantees.
EvoGrad improves efficiency in meta-learning and hyperparameter optimization.
problem Efficiently compute hypergradients for larger network architectures.
method Uses evolutionary techniques to estimate hypergradients without second-order derivatives or longer computational graphs.
result Significant improvements in efficiency, enabling scaling to bigger architectures.
Study efficient interactive learning for structured outputs with reliable computation.
problem Interactive learning with noisy labels and structured output spaces.
method Identify and utilize CRISPs (probabilistic models) that guarantee reliable and efficient computation of probabilistic quantities.
result CRISPs enable robust and efficient active and skeptical learning in large structured output spaces.
Julia accelerates machine learning in various fields with balance of efficiency and simplicity.
problem Efficiency and simplicity in machine learning algorithms.
method Developed and applied Julia language in machine learning.
result Julia balances efficiency and simplicity for machine learning.
Efficiently learns disentangled representations using conditional probability differences.
problem Learning disentangled representations with causal mechanisms.
method Approximates difference of conditional probabilities with model's generalization ability.
result 1.9--11.0 more sample efficient and 9.4--32.4 times quicker than previous method.
Enhanced feedback model improves sample-efficiency in POMDPs.
problem Exponential hardness of learning in POMDPs.
method Multiple observations in hindsight feedback model.
result Sample-efficient learning possible for new subclasses of POMDPs.
BREMEN optimizes policies offline with fewer data, achieving efficient deployment.
problem High cost of updating policies in real-world applications.
method Behavior-Regularized Model-ENsemble (BREMEN) algorithm for offline optimization.
result BREMEN achieves impressive deployment efficiency with 5-10 deployments, outperforming standard RL methods.
Efficient privacy-preserving machine learning framework using random transformations.
problem Slow training and inference speed in privacy-preserving machine learning systems.
method Random transformations like linear and permutation, combined with arithmetic sharing.
result High efficiency and low computation cost in private machine learning.
Improves sample efficiency in reinforcement learning with input representation.
problem Poor sample efficiency in reinforcement learning.
method Attention-based method to project inputs into an invariant representation space.
result Representation space is smaller for inputs of objects, improving sample efficiency.
This paper tackles energy-efficient machine learning on low-power devices.
problem Energy consumption in machine learning due to data communication.
method Dynamic averaging for integer exponential families on low-power processors.
result Achieves comparable model quality with significantly less communication and energy.
Modern deep learning methods provide effective means to learn good representations. However, is a good representation itself sufficient for sample efficient reinforcement learning? This question has largely been studied only with respect to (worst-case) approximation error, in the more classical approximate dynamic pro…
ASEs use surrogate estimation to efficiently evaluate model performance with minimal labels.
problem Efficient model evaluation with limited labels.
method Surrogate-based estimation and active learning.
result ASEs offer greater label-efficiency than current methods for deep neural networks.
Retrospective Analysis of the 2019 MineRL Competition on Sample Efficient Reinforcement Learningcs.LG
MineRL Competition reduced reinforcement learning sample needs.
problem Sample inefficiency in reinforcement learning.
method Human demonstrations and imitation learning integrated into reinforcement learning algorithms.
result Top solutions used deep reinforcement learning and imitation learning.
Kernel methods can learn hierarchical polynomials efficiently.
problem Learning hierarchical structure from data.
method Iteratively reweighting kernel machines using derivatives.
result Efficient learning of hierarchical polynomials.