Survey of deep learning methods for inverse problems, highlighting theoretical challenges.
problem Addressing theoretical gaps in deep learning for inverse problems.
method Survey of existing theoretical developments and open problems.
result Highlighting ongoing challenges in deep learning for inverse problems.
Survey of offline RL theory and practical algorithm design challenges.
problem Optimizing return from fixed agent trajectories without additional interactions.
method Theoretical insights and practical algorithm design.
result Conditions for practical offline RL algorithms and their limitations.
This review reports some key results in theoretical investigations on configurations of lipid membranes and presents several challenges in this field which involve (i) exact solutions to the shape equation of lipid vesicles; (ii) exact solutions to the governing equations of open lipid membranes; (iii) neck condition o…
The paper reviews MARL and its causal challenges, advocating for a 'causality first' approach.
problem Challenges in multi-agent reinforcement learning (MARL) and lack of theoretical guarantees for emergent behavior.
method Discussion of how causal methods can improve safety, interpretability, and robustness in MARL.
result Causal methods can provide strong theoretical guarantees for emergent behavior in MARL.
Develops a measure-theoretic framework for complex co-occurrence data.
problem Modeling and interpreting complex co-occurrences in high-dimensional data.
method Introduces measure-theoretic probability and conditional probability, investigates E-integrals.
result Establishes a rigorous measure-theoretic foundation for co-occurrence modeling.
Deep learning models are growing, posing new mathematical challenges.
problem Mathematical challenges in training, inference, generalization, and optimization of deep models.
method Formal mathematical analysis and communication with mathematicians, statisticians, and computer scientists.
result A set of new mathematical challenges in deep learning.
This review clarifies XAI for regression models and establishes new theoretical insights.
problem Lack of XAI techniques for regression models, especially in safety-critical applications.
method Clarifies conceptual differences, establishes theoretical insights, provides demonstrations, discusses challenges.
result Novel theoretical insights and demonstrations of XAI for regression models.
There is renewed interest in formulating integration as an inference problem, motivated by obtaining a full distribution over numerical error that can be propagated through subsequent computation. Current methods, such as Bayesian Quadrature, demonstrate impressive empirical performance but lack theoretical analysis. A…
Examines challenges and proposes new approaches in machine learning theory.
problem Challenges in machine learning as a function approximation and optimization.
method Mathematical analysis of gradient descent, fixed network limitations, and RNNs.
result New insights and mathematical approaches to improve machine learning.
Improved theoretical guarantees for Top Two algorithms.
problem Theoretical support for best arm identification with bounded distributions.
method General analysis of Top Two methods, identifying desirable properties and replacing sampling step.
result Theoretical support for Top Two algorithms with bounded distributions.
Special issue on understanding physical processes from unusual diffusion patterns.
problem Understanding physical processes from anomalous diffusion data.
method Not explicitly described in the abstract, but likely involves analysis of data from the Anomalous Diffusion Challenge.
result Not explicitly stated, but likely includes analysis of physical processes from anomalous diffusion data.
A new kernel for ranked data tackles computational challenges.
problem Complex geometric structure and partial rankings make existing algorithms infeasible for real-world applications.
method Derives a graph cut kernel that combines submodular optimization and kernel-based methods.
result The graph cut kernel efficiently handles large-scale ranked data.
This review of the book "The Challenge of Financial Stability: A New Model and its Applications" by Goodhart C.A.E. and Tsomocos D.P. highlights the potential of the framework of strategic partial default of banks with credit chain on the interbank market for further theoretical and applied research on financial stabil…
Trans-GCR uses GCR model for node classification, providing theoretical guarantees and superior performance.
problem Challenges in obtaining node classification labels in real-world scenarios.
method Graph Convolutional Multinomial Logistic Regression (GCR) model and transfer learning method based on GCR.
result Trans-GCR provides superior empirical performance and theoretical guarantees.
Adv-SSL learns unbiased representations from unlabeled data with theoretical guarantees.
problem Learning unbiased representations from unlabeled data.
method Adv-SSL, a novel adversarial self-supervised learning approach.
result Adv-SSL achieves strong classification performance with limited downstream labels.
This paper studies distributed estimation and support recovery for high-dimensional linear regression model with heavy-tailed noise. To deal with heavy-tailed noise whose variance can be infinite, we adopt the quantile regression loss function instead of the commonly used squared loss. However, the non-smooth quantile …
Nested sampling is a powerful technique for exploring high-likelihood regions, but its theoretical derivation is complex and involves approximations.
problem Sampling from likelihood-constrained priors in nested sampling
method Providing a comprehensive and detailed exposition of nested sampling derivation and practical challenges
result Deepening understanding of nested sampling and fostering future enhancements
Proposes CoPO, a new policy optimization method for competitive games.
problem Designing efficient optimization methods for competitive Markov decision processes.
method Competitive policy optimization (CoPO) approach that exploits game-theoretic nature of competitive games.
result Stable optimization, convergence to sophisticated strategies, and higher scores compared to baseline methods.
We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables. We refer to this as metric-constrained optimization, and give several examples where problems of this form arise in machine learning applications and theoretical approximation algorithms for graph cluste…
First-order method solves stochastic bilevel optimization with linear constraints.
problem Stochastic bilevel optimization with linear constraints and noise.
method Developed a novel framework using gradient-based techniques and smoothed penalty functions.
result Achieved finite-time convergence guarantees for (δ,ε)-Goldstein stationary points. This thesis explores robust machine learning against adversarial examples.
problem How to create machine learning systems robust to adversarial examples.
method Theoretical exploration and development of new learning algorithms with robustness guarantees.
result Developed new learning algorithms with provable robustness guarantees.
Line graph transformation aids graph isomorphism tests by excluding challenging graph properties.
problem Limited theoretical understanding of line graph transformation's impact on GNN models.
method Examined CFI and strongly regular graphs, showing line graph transformation helps WL tests distinguish these graphs.
result Line graph transformation aids WL tests in distinguishing challenging graph properties.
The utility of Potential Future Exposure (PFE) for counterparty trading limits is being challenged by new market developments, notably widespread regulatory Initial Margin (using 99% 10-day exposure), and netting of trade and collateral flows. However PFE has pre-existing challenges w.r.t. portfolios/distributions, col…
New bounds estimate learning algorithm performance using prediction information.
problem Estimating the performance of black-box learning algorithms.
method Information-theoretic bounds based on prediction information.
result Improved bounds applicable to deterministic algorithms and easier to estimate.
S2M optimizes mining for diverse data subpopulations.
problem Scalability and uniformity in training sets with many labels and diverse data.
method Doubly-stochastic mining (S2M) computes per-example and minibatch losses on hardest labels/examples.
result S2M ensures good performance across all data subpopulations.
Transfer learning has been proven effective when within-target labeled data is scarce. A lot of works have developed successful algorithms and empirically observed positive transfer effect that improves target generalization error using source knowledge. However, theoretical analysis of transfer learning is more challe…
Despite the growing interest in generative adversarial networks (GANs), training GANs remains a challenging problem, both from a theoretical and a practical standpoint. To address this challenge, in this paper, we propose a novel way to exploit the unique geometry of the real data, especially the manifold information. …
Paper addresses RLHF alignment challenges with novel algorithms.
problem Challenges in RLHF alignment, especially in strategic exploration.
method Develops a reverse-KL regularized contextual bandit formulation and proposes efficient algorithms with theoretical guarantees.
result Proposed methods significantly outperform existing RLHF algorithms in real-world experiments.
Approximate inference algorithm is one of the fundamental research fields in machine learning. The two dominant theoretical inference frameworks in machine learning are variational inference (VI) and Markov chain Monte Carlo (MCMC). However, because of the fundamental limitation in the theory, it is very challenging to…
A key challenge for modern Bayesian statistics is how to perform scalable inference of posterior distributions. To address this challenge, variational Bayes (VB) methods have emerged as a popular alternative to the classical Markov chain Monte Carlo (MCMC) methods. VB methods tend to be faster while achieving comparabl…
Survey of AI in finance covering models, strategies, and knowledge systems.
problem Challenges in applying AI to financial markets, especially in high-frequency trading.
method Systematic analysis of financial AI across predictive models, decision frameworks, and knowledge augmentation systems.
result Critical trade-offs and gaps between theoretical advances and practical implementation in financial AI.
New method uses dynamic programming for meta continual learning.
problem Challenges of generalization and catastrophic forgetting in sequential learning.
method Developed a theoretical framework using dynamic programming for meta continual learning.
result Theoretical and practical method achieves better accuracy than existing methods.
Meta clustering categorizes learners for collaborative learning.
problem Filtering out unqualified collaborators in collaborative learning.
method Select-Exchange-Cluster (SEC) method to classify learners by their supervised functions.
result SEC can cluster learners into accurate collaboration sets and enhance single-learner performance.
A new approach predicts next observations without explicit decoding for better control.
problem High-dimensional observations and unknown dynamics in real-world control tasks.
method Proposes a novel information-theoretic LCE approach using predictive coding to develop a decoder-free model.
result The model reliably learns a controllable latent space leading to superior performance.
New framework for learning from imbalanced data with theoretical guarantees.
problem Class imbalance in machine learning, especially in multi-class problems.
method Theoretical framework and new margin loss function for imbalanced classification.
result Proves strong H-consistency of the proposed margin loss function. High-velocity streams of high-dimensional data pose significant "big data" analysis challenges across a range of applications and settings. Online learning and online convex programming play a significant role in the rapid recovery of important or anomalous information from these large datastreams. While recent advance…
This paper tackles deferral learning with multiple experts, providing strong theoretical guarantees.
problem Optimizing input assignment to experts balancing accuracy and computational cost.
method Introducing new surrogate loss functions and efficient algorithms with strong theoretical learning guarantees.
result Realizable H-consistency, H-consistency bounds, and Bayes-consistency for deferral learning. The problem of low-rank matrix estimation recently received a lot of attention due to challenging applications. A lot of work has been done on rank-penalized methods and convex relaxation, both on the theoretical and applied sides. However, only a few papers considered Bayesian estimation. In this paper, we review the …
This paper tackles distribution shift in model-based offline RL, proposing a shifts-aware reward method.
problem Distribution shift challenges model-based offline RL by distorting value estimation and policy optimization.
method The paper disentangles the problem into model bias and policy shift, proposing a shifts-aware reward through probabilistic inference.
result The proposed shifts-aware reward method effectively mitigates distribution shift and improves policy optimization.
In the era of big data, it is desired to develop efficient machine learning algorithms to tackle massive data challenges such as storage bottleneck, algorithmic scalability, and interpretability. In this paper, we develop a novel efficient classification algorithm, called fast polynomial kernel classification (FPC), to…
High dimensional data analysis is known to be as a challenging problem. In this article, we give a theoretical analysis of high dimensional classification of Gaussian data which relies on a geometrical analysis of the error measure. It links a problem of classification with a problem of nonparametric regression. We giv…
Eliciting labels from crowds is a potential way to obtain large labeled data. Despite a variety of methods developed for learning from crowds, a key challenge remains unsolved: \emph{learning from crowds without knowing the information structure among the crowds a priori, when some people of the crowds make highly corr…
The Machina thought experiments pose to major non-expected utility models challenges that are similar to those posed by the Ellsberg thought experiments to subjective expected utility theory (SEUT). We test human choices in the `Ellsberg three-color example', confirming typical ambiguity aversion patterns, and the `Mac…
QTRAN++ improves MARL performance in complex environments.
problem Poor empirical performance of QTRAN in complex environments.
method Stabilizing training objective, removing role separation, and introducing a multi-head mixing network.
result QTRAN++ achieves state-of-the-art performance in the Starcraft Multi-Agent Challenge (SMAC).
This work shows MLPs can approximate monotonic functions without bounded activations.
problem Optimizing MLPs with monotonic constraints and bounded activations.
method Generalized theoretical results showing MLPs with non-negative weights and saturating activations are universal approximators.
result MLPs with non-negative weights and saturating activations are universal approximators for monotonic functions.
Meta-BO method clusters and learns from prior tasks to optimize heterogeneous functions.
problem Optimizing multiple functions with historical data and scalability issues.
method Clustering-based meta-learning, surrogate prototypes, adaptive weighting policies.
result Scalable and robust meta-BO method improves convergence to global optimum.
Hypothesis testing for graphs has been an important tool in applied research fields for more than two decades, and still remains a challenging problem as one often needs to draw inference from few replicates of large graphs. Recent studies in statistics and learning theory have provided some theoretical insights about …
The paper addresses nonconvex penalized LAD estimation in partial linear models using DNNs.
problem Challenges in nonconvex penalized LAD estimation with DNNs in partial linear models.
method Parameterizes nonparametric term with DNNs, formulates penalized LAD problem, introduces proximal subgradient method.
result Establishes consistency, convergence rate, and asymptotic normality of the estimator.