Skip to main content
Search

# Information Bottleneck

3 related articles

Subscribe to updates
  1. arXiv

    GRID disentangles a general reward from heterogeneous demonstrators, enabling generalist pretraining that outperforms standard learning-from-demonstration baselines

    The work introduces General Reward Inference and Disentanglement (GRID), a social learning method that uses an information bottleneck to decompose each agent's reward function into a general reward shared across all agents and specific rewards capturing individual preferences, so that training solely on the general reward yields a generalist agent internalizing universal environmental competencies such as safety and basic task proficiency; experiments on a synthetic basis function decomposition, multi-agent Craftax, MuJoCo Gym continuous control, and the Highway-Env driving simulator confirm semantically meaningful reward disentanglement, outperformance of standard learning-from-demonstration baselines, and more efficient and stable specialization.

  2. A PhD thesis proposes three methodological innovations and a design framework for bringing causal machine learning into clinical practice, testing continuous treatment models on a physiotherapy dosage case

    This PhD thesis addresses how causal machine learning can be translated into real-world clinical practice along three lines: for binary treatment effect estimation in clinical contexts it identifies eight key decision points that directly influence treatment effect estimates and proposes a structured framework for designing causal models in clinical settings; for the difficulty of verifying counterfactual predictions it proposes a novel method that grounds average model predictions in a group-level quantity that can be empirically verified using randomized or real-world clinical trial data, and shows that a model with a lower counterfactual error bound can be constructed and that information bottleneck regularization improves treatment effect estimation; for continuous causal machine learn

  3. arXiv

    Letting the Sparsity Coefficient Learn Its Own Compression: Training-Adaptive Convolutional Sparse Coding Through an Information Bottleneck Lens

    This work turns the sparsity coefficient of convolutional sparse coding from a manually fixed hyperparameter into a differentiable variable jointly learned with network parameters through unfolded FISTA iterations, interprets that coefficient within an information bottleneck framework as the controller of the compression-retention trade-off, achieves competitive clean-data recognition on CIFAR-10/100 and ImageNet-1K with greatly improved robustness under various input perturbations, and introduces a label-free post-training adaptation strategy that adjusts compression strength using a small set of unlabeled corrupted samples while keeping the main network parameters frozen.

You’re all caught up