Gaussian processes with linear constraints ensure function adherence.
problem Ensuring function adherence to known constraints in Gaussian processes.
method Modification of covariance function and explicit incorporation of linear constraints through a transformation operator.
result Guaranteed fulfillment of constraints in predictions and samples.
Simulation framework assesses ROI of chronic disease adherence and policy timing.
problem Uncertainty in ROI of adherence-enhancing interventions under heterogeneous patient behavior and socioeconomic variation.
method Simulation-based framework integrating disease progression, time-varying adherence, and policy timing.
result Early and adaptive interventions yield highest ROI, exceeding 20% under certain conditions.
Study finds non-adherence to schizophrenia meds leads to earlier adverse events.
problem Impact of medication non-adherence on adverse outcomes in schizophrenia patients.
method Survival analysis, causal inference methods (T-learner, S-learner, nearest neighbor matching), different amounts of longitudinal information.
result Non-adherence to schizophrenia meds advances adverse events by 1 to 4 months.
Paper predicts medication non-adherence in cancer patients using ML.
problem Predicting and understanding medication non-adherence in cancer patients.
method Developed ML models to predict non-adherence, fine-tuned by oncologists.
result Improved support for cancer patients through ML risk scores.
Smart bin monitors predict medication adherence with high accuracy.
problem Predicting chronic medication adherence to improve healthcare efficiency.
method Machine learning models trained on IoT device data.
result High predictive performance (ROC AUC 0.86).
Religious adherence reduces corporate greenwashing behavior.
problem Greenwashing behavior by corporations.
method Analysis of a large US firm sample (2005-2019), focusing on selective disclosure.
result Religious adherence correlates with lower greenwashing behavior.
The paper tackles AI advice giving by considering adherence levels and defer options.
problem Inadequate consideration of human adherence to AI recommendations.
method Sequential decision-making model that considers adherence levels and incorporates a defer option.
result Specialized learning algorithms provide better convergence and empirical performance.
HardCoRe-NAS finds fitting neural networks adhering to hard resource constraints.
problem Finding fitting neural networks that adhere to hard resource constraints.
method Accurate formulation of resource requirement and scalable search method.
result HardCoRe-NAS generates state-of-the-art architectures strictly satisfying hard resource constraints.
OptiLIME improves LIME explanations by balancing stability and adherence.
problem LIME's instability and lack of reliability in explanations.
method OptiLIME uses a deterministic sampling approach and feature selection to maximize stability while retaining predefined adherence.
result OptiLIME provides more reliable and interpretable explanations.
Model predicts missed doses and targets TB patients more effectively.
problem Improving adherence to TB treatment using digital data.
method Deep learning model trained on 17k TB patients' adherence data.
result Model predicts 21% more patients at risk of missing doses.
latrend simplifies longitudinal clustering for numeric measurements.
problem Clustering of longitudinal data to identify common trends over time.
method Unified framework for applying various clustering methods.
result Facilitates comparison and rapid prototyping of new methods.
Study optimal and equitable encouragement policies for treatment adherence.
problem Optimal treatment adherence policies in the presence of human non-adherence.
method Covariate-conditional no-direct-effect model of encouragement; tractable policy characterizations under constraints.
result Induced treatment take-up is the fairness target, not recommendation rates.
Algorithm minimizes regret while adhering to unknown safety constraints.
problem Online learning with unknown safety constraints.
method General meta-algorithm leveraging online regression and learning oracles.
result Concrete algorithm with T \sqrt{T} T regret for linear constraints. Proposes a Gaussian process model for constrained dynamics learning.
problem Challenges in identifying constrained dynamics of mechanical systems.
method Combines analytical mechanics with Gaussian process regression.
result Improves data efficiency and constraint integrity in predictions.
New approach tackles non-Markovian behavior in maternal health programs.
problem Improving adherence and engagement in maternal and child healthcare programs.
method Extending RMABs to non-Markovian settings, using time-series forecasting and TARI policy.
result Significant increase in engagement and content listened compared to existing methods.
New testing method for robust actor-critic bandit algorithms.
problem Balancing data collection for app performance and user adherence.
method Modified actor-critic algorithm and novel testing procedure.
result Testing procedure is robust to critic misspecification.
Paper tackles inventory management with deep learning, improving performance and adherence to constraints.
problem Managing inventory with limited resources and constraints.
method Proposes a novel method to sample from a distribution of possible constraint paths, extends exo-IDP formulation, introduces neural coordinator, and uses modified DirectBackprop algorithm.
result Deep reinforcement learning policies with a neural coordinator outperform classic baselines in terms of performance and adherence to constraints.
New method uses quantum annealing and VAN for better statistical mechanics calculations.
problem Difficulty in computing partition function in statistical mechanics.
method Combines quantum annealing samples with variational autoregressive networks.
result Enhanced accuracy in finite-size Sherrington-Kirkpatrick model.
A theory which describes the share price evolution at financial markets as a continuous-time random walk has been generalized in order to take into account the dependence of waiting times t on price returns x. A joint probability density function (pdf) which uses the concept of a Lévy stable distribution is worked out.…
New method constructs asymptotic convex hypersurfaces via equidistant hyperplanes.
problem Constructing asymptotic convex hypersurfaces in hyperbolic space.
method Approximating hypersurface by geodesic graphs over equidistant hyperplanes.
result Existence of complete, strictly locally convex hypersurfaces with prescribed asymptotic boundary.
Paper tackles robust offline RL with heavy-tailed rewards.
problem Real-world applications often encounter heavy-tailed rewards, challenging offline RL.
method Proposes ROAM and ROOM algorithms using median-of-means method for robust off-policy evaluation and OPO.
result Demonstrates superior performance on heavy-tailed reward datasets compared to existing methods.
iStructTab improves multimodal learning by optimizing feature sequencing.
problem Redundancy, dispersion, and generalization issues in multimodal learning of images and tabular data.
method Graph-Enhanced Descriptor Sequencing (GEDS) algorithm that refines statistical descriptors through similarity graph-based computations.
result iStructTab effectively minimizes feature dispersion, improving predictive performance and robustness.
Bayesian approach for solving systems of linear PDEs with boundary conditions.
problem Modeling data efficiently with prior knowledge from systems of linear PDEs.
method Construct multi-output Gaussian process priors using Gröbner bases and pullback parametrizations.
result Gaussian process priors can represent solutions to systems of linear PDEs adhering to boundary conditions.
CaTs use DAGs with transformers to enforce causal constraints, improving neural network robustness.
problem Neural networks lack inherent causal structure respect, leading to reliability issues.
method Introducing Causal Transformers (CaTs) that operate under predefined causal constraints specified by DAGs.
result CaTs improve robustness and interpretability of neural networks under causal constraints.
System tracks regulatory changes for compliance officers.
problem Struggling to keep up with regulatory changes.
method Fetch announcements, classify importance and applicability.
result Simple hierarchical classification works best.
Model optimizes mediation for insolvent suppliers by finding an optimal contract solution.
problem Optimizing contract outcomes for insolvent suppliers in disputes.
method Linear optimization model with complex number phasor approach and Gompertz function for supplier offers.
result Optimal solution adherence to initial contract terms.
dCMF models evolving patterns in multiway data with temporal dynamics.
problem Capturing evolving patterns in multiway datasets with temporal dependencies.
method Time-aware coupled factorization model constrained by LDS structure.
result dCMF outperforms alternatives in capturing complex dynamics.
Proposes tau-FPL for efficient false-positive rate control in linear time.
problem Learning classifiers with strict false-positive rate constraints.
method Scoring-thresholding approach with linear time efficiency.
result Superior performance over existing approaches in false-positive rate control.
New method initializes sigmoidal MLPs for interpretable shapes.
problem Creating interpretable decision boundaries in neural networks.
method Introducing a geometry-aware initialization for sigmoidal multi-layer perceptrons (MLPs) using tropical geometry.
result Sigmoidal MLPs can have decision boundaries aligned with prescribed shapes at initialization.
Enhanced PPO improves stability and performance.
problem Performance instability in PPO.
method Introduces Truly PPO with new clipping function and trust region constraint.
result Improves sample efficiency and performance.
GUM tackles MARL by avoiding overestimation through state-marginal restriction.
problem Overestimation of values in large joint state-action spaces.
method Greedy UnMixing through state-marginal restriction and unmixing.
result Superior performance compared to existing Q-learning and general MARL algorithms.
System predicts HIV patients at risk of dropping out of care.
problem High non-adherence and dropout rates among HIV patients.
method Predictive machine learning model based on resource constraints, stability, and fairness.
result Model performs 3x better than baseline for clinical use and 2.3x better for city-wide use.
LLMs simulate financial markets, revealing consistent trading strategies and market dynamics.
problem Testing financial theories with AI trading agents.
method Simulated stock market with LLMs using a persistent order book and varied strategies.
result LLMs can simulate different trading strategies and market dynamics.
The paper analyzes the convergence of CART under a SID condition, improving previous results.
problem Investigating the convergence rate of CART under a sufficient impurity decrease condition.
method Established an upper bound on prediction error under SID condition, introduced easily verifiable conditions.
result Improved convergence rate of CART under SID condition, demonstrated examples of error bound limitations.
Deep RL learns driving decisions from compact scene descriptions.
problem Learning consistent driving behavior from varying environments.
method Compact semantic state representation for reinforcement learning.
result Agent adapts behavior online without re-training.
This paper introduces a privacy-aware Bayesian approach that combines ensembles of classifiers and clusterers to perform semi-supervised and transductive learning. We consider scenarios where instances and their classification/clustering results are distributed across different data sites and have sharing restrictions.…
Efficient CD algorithms on matrix manifolds for optimization problems.
problem Optimization on Riemannian manifolds with computational efficiency.
method Developed coordinate descent algorithms for various matrix manifolds, updating only a few variables at each iteration.
result Proposed algorithms achieve low cost per iteration and a more efficient variant via first-order approximation.
Proposes a method to generate text that adheres to logical constraints.
problem Generating text that respects logical constraints is hard for autoregressive models.
method Bayesian conditioning to draw samples subject to a constraint, considering the entire sequence and inducing a local, factorized distribution.
result Our approach generates samples that closely approximate the target distribution and are guaranteed to satisfy the constraints.
This paper simulates society's evolution using agent-based models and alternate maximization steps.
problem Understanding the complex evolution of human society.
method Agent-based simulation with a high population, joint alternate maximization algorithm.
result The proposed model shows societies develop in a realistic manner.
Optimizes data-driven design problems on implicit manifolds using score functions.
problem Optimizing over implicit low-dimensional manifolds in high-dimensional data.
method Introduces a link function connecting data distribution to manifold operations, enabling efficient optimization.
result Establishes theoretical guarantees for feasibility and optimality of proposed algorithms.
Game-theoretic flow allocation models network dynamics.
problem Maximizing flow through a network with strategic node allocations.
method Game-theoretic analysis of flow allocation strategies in a network.
result Existence and computational complexity of Nash and strong equilibria.
The study finds optimal curvature pinching in Heintze groups.
problem Exploring curvature properties in Heintze groups.
method Examining metric properties of rank-one symmetric spaces, proving existence of metrics on Heintze groups of Carnot-type.
result Optimal curvature pinching is demonstrated in a special case.
Paper tackles multi-view reinforcement learning with two methods.
problem Decision making with shared dynamics and different observation models.
method Observation augmentation and cross-view policy transfer.
result Reductions in sample complexities and computational time for multi-view environments.
FOCOPS optimizes agent's behavior while adhering to constraints.
problem Optimizing agent's behavior while respecting safety constraints.
method FOCOPS solves a constrained optimization problem in policy space, then projects the solution back into the parametric space.
result FOCOPS achieves better performance on constrained robotics tasks.
The paper analyzes identifiability in ODE systems with hidden confounders.
problem Identifiability of ODE systems with hidden confounders.
method Systematic analysis of identifiability in linear ODE systems with hidden confounders, considering both no causal relationships and causal dependencies.
result Comprehensive identifiability analysis of ODE systems with hidden confounders, including causal dependencies.
New RL agent learns sparse rewards efficiently.
problem Sparse-reward environments and computational expense.
method Active inference with novel free energy minimization.
result High sample efficiency and online operation.
A new framework for controllable generation of discrete masked models.
problem Efficient controllable generation of discrete data models.
method Plug-and-play framework based on importance sampling.
result Demonstrates versatility across multiple domains, including protein design.
New method for reworking music pieces using conditional autoregressive modeling.
problem Reimagining existing musical compositions while maintaining structure.
method Conditional autoregressive pipeline for efficient music recomposition.
result Diverse and structured generation of new content conditioned on chord sequence annotations.