Agent learns independently controllable factors by interacting with its environment.
problem Discovering independent controllable factors in environments.
method Proposes a training framework for an agent to interact with its environment and learn independently controllable factors.
result Agent can disentangle independently controllable aspects of the environment without extrinsic reward.
Agent learns independently controllable factors by interacting with environment.
problem Discovering independently controllable factors of variation in interactions with the world.
method Proposed a training framework for an agent to interact with the environment, hypothesizing that independently controllable factors correspond to aspects of the environment that can be manipulated.
result Agent can disentangle independently controllable aspects of the environment without extrinsic reward signals.
Contrastive ICA identifies features in experimental groups relative to controls.
problem Jointly analyzing experimental and control datasets to identify salient features.
method Developed contrastive ICA (cICA) using tensor decomposition.
result cICA identifies patterns and visualizes data effectively, outperforming existing methods.
Discusses MultiFIT for multivariate dependence, comparing it to HSIC tests.
problem Comparing Multiscale Fisher's Independence Test (MultiFIT) to HSIC tests for multivariate dependence.
method Compares MultiFIT to HSIC tests, highlighting exact level control and performance limitations.
result Observes performance limitations of MultiFIT in terms of test power.
Counterexamples show deconfounder fails to control multi-cause confounding.
problem Deconfounding method fails to handle multi-cause confounding.
method Incorrectly inferring independence and joint independence from conditional independence.
result Two simple counterexamples demonstrate deconfounder's failure.
Study uses viscosity solutions to solve control problems involving measure-valued martingales.
problem Stochastic control problems with measure-valued martingale state processes.
method Viscosity solution approach exploiting structural properties of MVM processes.
result Value function is the unique viscosity solution to the HJB equation.
Controller stabilizes spherical robot's position and line-of-sight.
problem Stabilizing a spherical robot's position and line-of-sight.
method Geometric control law with feedforward and proportional-derivative control.
result Controller performance validated through simulations.
Deep CITs test conditional independence in images, improving brain MRI scan analysis.
problem Testing conditional independence in complex, high-dimensional variables like images.
method Combines embedding maps and nonparametric CITs for feature representations.
result Valid DNCITs for brain MRI scans and behavioral traits, confirming null results.
New conditions for stabilizing systems are shown to be independent but stronger under certain conditions.
problem Necessary conditions for stabilizing feedback control systems.
method Extensions of Brockett's and Coron's conditions in fiber and vector bundle pictures.
result The conditions are independent in the fiber bundle picture but stronger in the vector bundle picture under specific conditions.
The paper investigates quantitative rigidity using Colding's monotonicity formulas for Ricci curvature.
problem Quantifying rigidity in manifolds with nonnegative Ricci curvature.
method Investigates pinching of Colding's monotone functionals and constructs k-splitting functions. result Quantitative control of splitting functions by pinching at independent points controls the distance to the nearest cone.
Study absolute equivalence for Pfaffian systems, applying to control systems.
problem Absolute equivalence of Pfaffian systems with specific independence conditions.
method Structural results for Pfaffian systems of corank 3, applied to control systems.
result Dynamic feedback linearization of control systems with 2 inputs.
New method uses CDMs to improve CI testing without distributional assumptions.
problem Testing conditional independence when the conditional distribution is unknown.
method Uses conditional diffusion models (CDMs) to approximate X∣Z and a classifier-based CMI estimator. result Proposed method performs better than GAN-based CI tests and controls type I and II errors.
New algorithm controls systems with unknown, changing losses.
problem Control systems with adversarial perturbations and unknown loss function.
method Efficient sublinear regret algorithm for bandit convex optimization with memory.
result Achieves efficient control with sublinear regret in the presence of unknown, changing losses.
ECCIT improves conditional independence tests by calibrating for miscalibration.
problem Inaccurate frequentist guarantees in CITs, especially in small samples and misspecified models.
method Empirically Calibrated Conditional Independence Tests (ECCIT) that optimize and correct for miscalibration.
result ECCIT achieves valid FDR with higher power than existing calibration strategies.
USP test improves on Pearson's chi-squared and G-test for independence.
problem Deficiencies in Pearson's chi-squared and G-test for independence. method USP test based on U-statistic estimator of population dependence measure. result USP test controls size, handles small cell counts, and detects minimal violations of independence.
New method controls linear systems with adversarial disturbances.
problem Controlling linear dynamical systems under adversarial conditions.
method Novel convex relaxation using spectral filters from Hankel matrix eigenvectors.
result Polylogarithmic running time improvement over prior methods.
We provide the first differentially private algorithms for controlling the false discovery rate (FDR) in multiple hypothesis testing, with essentially no loss in power under certain conditions. Our general approach is to adapt a well-known variant of the Benjamini-Hochberg procedure (BHq), making each step differential…
We consider the problem of finding model-independent bounds on the price of an Asian option, when the call prices at the maturity date of the option are known. Our methods differ from most approaches to model-independent pricing in that we consider the problem as a dynamic programming problem, where the controlled proc…
A2C-based MARL controls large-scale traffic signals more efficiently.
problem Scalability issue in centralized RL for large-scale traffic control.
method Decentralized Multi-Agent A2C with improved observability and reduced learning difficulty.
result Optimal, robust, and sample-efficient control over other algorithms.
We solve a class of control problems with fuel constraint by means of the log-Laplace transforms of J-functionals of Dawson-Watanabe superprocesses. This solution is related to the superprocess solution of quasilinear parabolic PDEs with singular terminal condition. For the probabilistic verification proof, we develo…
Generative AI models improve clinical trial data by generating survival outcomes.
problem Generating valid survival outcomes for clinical trials with synthetic data.
method A variational autoencoder (VAE) that jointly generates mixed-type covariates and survival outcomes.
result The method outperforms GAN baselines on fidelity, utility, and privacy metrics.
Optimizes tree ensemble models for controllable variables.
problem Maximizing predicted value by setting controllable independent variables in tree ensemble models.
method Formulated as mixed-integer optimization problem, developed solution methods based on Benders decomposition and iteratively generating tree split constraints.
result Efficiently solves large-scale instances to near or full optimality, outperforming heuristic approaches.
A Closer Look at Disentangling in β-VAE shows non-monotonic inference performance.
problem Learning disentangled representations from data.
method Generalization of VAE using variational inference with hyperparameter β.
result Non-monotonic inference performance in β-VAE with a finite optimal β.
Bayesian framework for optimal sampling and selection in ranking problems.
problem Optimal sampling and selection in statistical ranking and selection.
method Formulated as a stochastic control problem, derived Bellman equation, value function approximation for optimal policy.
result Approximately optimal allocation policy with one-step-ahead and asymptotic optimality for independent normal distributions.
This work improves fair tensor decomposition using a kernel criterion.
problem Learning fair low-rank tensor decompositions with statistical parity.
method Regularizes Canonical Polyadic Decomposition with KHSIC to ensure approximate statistical parity.
result The proposed algorithm achieves better fairness and fit than state-of-the-art FATR.
QCOMBO optimizes traffic signals across large networks using a combination of independent and centralized RL.
problem Optimizing global traffic conditions over large road networks using single-agent reinforcement learning is challenging.
method QCOMBO integrates independent and centralized learning to optimize traffic signals, using a consistency regularization loss to ensure scalability.
result QCOMBO outperforms state-of-the-art MARL algorithms in diverse road topologies and traffic flow conditions.
The paper develops online methods to control familywise error rate in growing hypothesis testing sequences.
problem Controlling familywise error rate in a growing sequence of hypotheses over time.
method Unified algorithmic concepts for offline and online FWER control, including new adaptive online algorithms.
result Substantial gains in power demonstrated and formally proved in a Gaussian sequence model.
Formula found for heat equation control and backward problems.
problem Exact control of nonhomogeneous backward heat equations.
method Time analyticity and eigenfunctions of the Laplacian.
result Explicit formula for control function in terms of heat kernel.
Abstract: New methods for finding optimal controls in geometric problems on Lie groups.
problem Finding optimal controls for geodesics on Lie groups.
method Pontryagin maximum principle, (co)adjoint representation, geodesic vector field.
result Developed methods to find normal geodesics and locally optimal controls.
CatNet controls FDR in LSTM models using SHAP feature importance and Gaussian mirrors.
problem Controlling False Discovery Rate (FDR) in LSTM models with feature selection.
method CatNet uses SHAP values for feature importance and Gaussian Mirror algorithm for FDR control. It introduces a kernel-based independence measure to handle feature correlations.
result CatNet reduces overfitting and improves model interpretability on simulated and real-world data.
Sequential Kernel-based Conditional Independence Testing via Adaptive Betting
problem Testing conditional independence
method Testing-by-betting on an adaptively optimized Kernel Conditional Independence statistic
result Significantly reduces Type I error inflation while preserving high power
Generic generation and manipulation of text is challenging and has limited success compared to recent deep generative modeling in visual domain. This paper aims at generating plausible natural language sentences, whose attributes are dynamically controlled by learning disentangled latent representations with designated…
A new framework for generative modeling using controlled vector fields.
problem Expressive modeling with limited parameters.
method Continuous-time modeling with modulated fixed vector fields and learned scalar controls.
result Expressive transport achieved with a small number of learned control channels.
A new method for stochastic optimal control improves accuracy over existing techniques.
problem Improving the accuracy of stochastic optimal control for noisy systems.
method Stochastic Optimal Control Matching (SOCM) using Iterative Diffusion Optimization (IDO) with path-wise reparameterization trick.
result SOCM achieves lower error than existing techniques for three out of four control problems, sometimes by an order of magnitude.
optHSIC tests independence between covariates and censored lifetimes using optimal transport.
problem Testing independence between a covariate and right-censored lifetimes.
method optHSIC uses optimal transport to transform censored data into uncensored data, then applies a permutation test with a kernel-based dependence measure.
result optHSIC has power against a wider class of alternatives than Cox regression and maintains type 1 error control even when censoring depends on the covariate.
A new method solves complex control problems with random coefficients.
problem Solving LQ McKean-Vlasov control problems with random coefficients.
method Decomposes the problem into two decoupled stochastic optimal control problems.
result The sum of optimal controls of auxiliary problems equals the original problem's optimal control.
This work formalizes guidance in diffusion models and introduces a stochastic control framework.
problem Lack of a solid theoretical foundation for guidance scheduling in diffusion models.
method Introduces a stochastic optimal control framework to cast guidance scheduling as an adaptive optimization problem.
result Establishes a principled foundation for more effective guidance in diffusion models.
This paper controls the capacity of weight-normalized deep neural networks using rectified linear units.
problem Capacity control of weight-normalized deep neural networks.
method Establishes upper bounds on Rademacher complexities and analyzes approximation properties of Lp,q weight normalized networks. result For L1,∞ weight normalized networks, the approximation error is controlled by the L1 norm of the output layer, and generalization error depends on the square root of depth. New proof of generalized Chow-Rashevskii theorem for non-linear systems.
problem Generalized Chow-Rashevskii Theorem for non-linear systems.
method Independent proof structure allowing generalizations to orbits of compositions of flows.
result Proof structure applicable to applications in Control Theory and controllability criteria.
New method controls false discoveries in financial asset pricing.
problem Controlling false discoveries in time series with unknown correlations.
method Double bootstrapping method to control false discovery rate.
result Superior statistical power and controlled false discovery rate.
Proposes a new method using GANs for testing conditional independence.
problem High-dimensional conditional independence testing in statistics and machine learning.
method Double GANs framework to learn conditional distributions, then construct a test statistic.
result The test statistic is doubly robust and has asymptotic power approaching one.
New methods control false discoveries near the boundary in conformal novelty detection.
problem Over-optimistic assessments near the rejection threshold in conformal novelty detection.
method Support line (SL) correction and alternative procedures to control boundary false discovery rate (bFDR).
result New procedures control the boundary false discovery rate (bFDR) in the conformal setting.
Geometric framework for dynamic feedback linearization of control systems with symmetry.
problem Dynamic feedback linearization of control systems with symmetry.
method Geometric framework based on Lie symmetry, systematic procedure for all smooth, generic system trajectories.
result Sufficient condition for dynamic feedback linearizability obtained.
Decentralized detection avoids sharing data, controls false discoveries.
problem Global false discovery rate control in decentralized novelty detection.
method Quantized surrogate models for low-precision sharing, preserving exchangeability.
result Quantized composite scores maintain competitive statistical power with reduced communication.
Constructs minimal laminations with controlled leaf topologies.
problem Creating minimal laminations with specific surface topologies.
method Using towers of finite coverings and developing a relative version of residual finiteness.
result Established finite covers with control on the second systole.
Method separates data into class and style factors using semi-supervised learning.
problem Separating generative factors of data into class and style vectors.
method Independent Vector Variational Autoencoders with semi-supervised learning and independence term.
result Improves classification performance and generation controllability.
Co-DQL improves traffic signal control using multi-agent reinforcement learning.
problem Optimizing signal timing for large-scale traffic control.
method Cooperative double Q-learning (Co-DQL) with mean field approximation and reward allocation.
result Co-DQL reduces average waiting time for vehicles in the road system.
FavMac maximizes value while controlling cost in multi-label prediction.
problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.