Agent learns optimal control inputs for plants with unknown parameters.
problem Optimal control for systems with unknown and changing parameters.
method Personalized control inputs based on stochastic dynamics.
result Demonstrated effectiveness on simulated system.
Kaczmarz++ accelerates convergence for ill-conditioned systems.
problem Solving ill-conditioned linear systems efficiently.
method Adaptive momentum acceleration, Tikhonov-regularized projections, and memoization.
result Kaczmarz++ converges faster than Krylov methods on ill-conditioned systems.
We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well known link projections. This gives a method of enumerating atoroidal graphs and he…
The paper shows how Lagrangian duality improves deep learning for constrained problems.
problem Learning optimization problems with complex constraints in science and engineering.
method Lagrangian duality applied to deep learning models.
result Lagrangian duality brings significant benefits for constrained learning tasks.
We discuss the stationary states of a model economy in which N heterogeneous adaptive consumers purchase commodity bundles repeatedly from P sellers. The system undergoes a transition from an inefficient to an efficient state as the number of consumers increases. In the latter phase, however, price fluctuations may…
DeepSVM learns SVMs without PDE solving, achieving high pricing accuracy.
problem Computational bottleneck in real-time calibration of stochastic volatility models.
method Physics-informed Deep Operator Network (PI-DeepONet) that enforces terminal payoffs and no-arbitrage conditions.
result DeepSVM achieves high pricing accuracy across various market dynamics.
We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing operations to the tree position…
This work trains a model to generate high-quality samples from random noise.
problem Generating high-quality samples from random noise.
method Infusion training to learn a Markov chain transition operator.
result The method produces high-quality samples in a small number of steps.
The notion that economies should normally be in equilibrium is by now well-established; equally well-established is that economies are almost never precisely in equilibrium. Using a very general formulation, we show that under dynamics that are second-order in time a price system can remain away from equilibrium with p…
We study the classification of Lefschetz fibrations up to stabilization by fiber sum operations. We show that for each genus there is a `universal' fibration f^0_g with the property that, if two Lefschetz fibrations over S^2 have the same Euler-Poincare characteristic and signature, the same numbers of reducible singul…
Develops a method to predict system behavior under disruptions.
problem Predicting changes in system behavior due to external perturbations.
method Counterfactual distribution regression for structured inference.
result Generalizes behavior predictions from natural to disrupted states.
A method to improve legacy AI systems without retraining.
problem Efficiently tuning existing AI systems with arbitrary complexity.
method Adding a cascade of modulating rules to legacy AI systems.
result Improves performance of legacy AI systems without retraining.
New estimator reduces nested expectation estimation costs.
problem Estimating repeatedly nested expectations is computationally expensive.
method Recursive Estimator for Arbitrary Depth (READ) using randomized multilevel Monte Carlo.
result Optimal computational cost of O(ε^(-2)) for every fixed D.
MixHop learns complex neighborhood relationships in graphs.
problem Existing graph neural networks cannot learn certain neighborhood mixing relationships.
method MixHop repeatedly mixes feature representations of neighbors at various distances.
result MixHop outperforms on challenging baselines and visualizes neighborhood information prioritization.
Paper proposes a reinforcement learning framework for speech recognition systems.
problem High cost of transcribing speech data for supervised training.
method Policy gradient method and hypothesis selection-based reinforcement learning.
result Improves recognition performance compared to unsupervised adaptation.
Dropout and other feature noising schemes control overfitting by artificially corrupting the training data. For generalized linear models, dropout performs a form of adaptive regularization. Using this viewpoint, we show that the dropout regularizer is first-order equivalent to an L2 regularizer applied after scaling t…
CICME estimates common and domain-specific causal mechanisms from multi-sensor data.
problem Inferring causal mechanisms from heterogeneous multi-sensor data across multiple domains.
method Three-step approach using Causal Transfer Learning (CTL).
result CICME reliably detects domain-invariant causal mechanisms and guides individual domain causal mechanism estimation.
DeepTrader learns to mimic a successful trader from market data.
problem Creating an algorithmic trader that performs as well as a human one.
method Trains a deep learning neural network on Level-2 LOB data to mimic a trader's quotes.
result DeepTrader can match or outperform existing algorithmic trading systems.
Amazon SageMaker AMT automates machine learning model tuning.
problem Challenging hyperparameter tuning for complex machine learning systems.
method Gradient-free optimization using random search or Bayesian optimization.
result AMT finds the best hyperparameter configurations for models.
Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.
problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.
A new method for releasing AI workflows to avoid premature incorrect results.
problem Statistical challenges in releasing AI workflows with adaptive scoring.
method Wrapper that calibrates and accumulates evidence from high-scoring failures.
result Reduces premature incorrect release while still releasing on moderate evidence.
New attacks reduce bad queries in black-box classifiers, improving effectiveness.
problem Evasion attacks often issue many bad queries, which are costly.
method Design new attacks that minimize bad queries while increasing non-bad queries.
result Reduces the number of bad queries by 1.5-7.3 times, improving attack effectiveness.
Deep learning framework for uncertainty quantification in physics.
problem Uncertainty in systems governed by non-linear differential equations.
method Physics-informed neural networks with adversarial inference.
result Effective training of deep generative models for physical systems.
Proposes a faster second-order method for MDPs.
problem Slow convergence of first-order value iteration methods in MDPs.
method Applies Newton-Raphson method to successive relaxation value iteration scheme.
result Second-order convergence and faster convergence to optimal solution.
New federated f-differential privacy for collaborative learning.
problem Privacy in federated learning.
method Introducing federated f-differential privacy and proposing a generic private federated learning framework. result Proves federated f-differential privacy provides privacy guarantee on each record of one client's data. Estimates hybrid dynamical systems with polynomial expansions and Markovian switching.
problem Identifying hybrid dynamical systems with nonlinear autoregressive exogenous (NARX) components and Markovian switching.
method Probabilistic framework using Expectation Maximization for parameter estimation, including submodel coefficients, hidden state values, and transition probabilities. Disentangles mode classification and NARX regression tasks. Uses soft-labels and coordinate descent approach for parameter fitting.
result Demonstrated on a SMNARX problem with three nonlinear sub-models, achieving parsimonious models through l1-norm bridge estimation and hard-thresholding.
Paper presents a deep learning approach to AC Optimal Power Flow.
problem Nonlinear and nonconvex OPF problem in power systems.
method Combines deep learning with Lagrangian dual methods.
result Deep learning model achieves highly accurate predictions.
This study measures liquidity risks in Aave, a blockchain lending protocol.
problem Liquidity risks in lending protocols, especially in Aave.
method Measurements of liquidity risks using Aave as a case study, focusing on available liquidity and market concentration.
result Liquidity risks in Aave are volatile and affect the protocol negatively, especially for repeat borrowers.
Studied stable solutions for symmetric systems with hypoelliptic operators.
problem Analyzing stable solutions for symmetric systems with hypoelliptic operators.
method Examined stable solutions for symmetric systems with hypoelliptic operators.
result Identified stable solutions for symmetric systems with hypoelliptic operators.
Quantum algorithm speeds up nested expectation estimation by nearly quadratically.
problem Estimating repeatedly nested expectations with quantum computing.
method Proposes a quantum algorithm achieving nearly quadratic speedup over classical methods.
result Achieves nearly quadratic speedup for RNEs, up to logarithmic factors.
Koopman operator theory simplifies complex systems analysis.
problem Analyzing nonlinear dynamical systems and complex networks.
method Estimating Koopman operator from data to reveal system properties.
result Koopman operators provide insights into system characteristics.
The paper solves the Cauchy problem for Friedrichs systems on specific spacetime manifolds.
problem Investigating the Cauchy problem for Friedrichs systems on globally hyperbolic manifolds with timelike boundaries.
method Admissible boundary conditions are imposed to show the existence and uniqueness of strong solutions. For hyperbolic systems, the Cauchy problem is also well-posed in the Hadamard sense.
result Existence and uniqueness of strong solutions for the Cauchy problem are proven under admissible boundary conditions.
Study shows neural operators can efficiently solve complex reaction-diffusion systems.
problem Efficiently solving nonlinear reaction-diffusion systems using neural operators.
method Laplacian-based neural operators applied to a generalized Gierer-Meinhardt system.
result Explicit approximation error bounds established for neural operators in terms of network parameters.
Develops a Krylov subspace method for estimating nonlinear systems with random noise.
problem Estimating nonlinear dynamical systems with random noise.
method Lifted representation of nonlinear dynamical systems using transfer operators, extended Arnoldi method, and shift-invert Arnoldi method.
result Empirical validation of methods on synthetic and real-world healthcare data.
A new metric compares dynamical systems using operator eigenvalues.
problem Comparing and interpolating nonlinear dynamical systems from trajectory data.
method Representing systems as distributions of operator eigenvalues and projectors, defining a spectral-Grassmann Wasserstein metric.
result The proposed metric outperforms standard operator-based distances in machine learning applications.
Improved AST method finds more useful failure scenarios for autonomous vehicles.
problem Finding useful failure scenarios for autonomous vehicle validation is challenging.
method Adaptive Stress Testing with reward augmentation, modified to encode domain information.
result The modified AST method discovers a larger and more expressive subset of failure scenarios.
Decentralized learning ensures stability in online queuing systems with packet rates above 1.
problem Ensuring stability in online queuing systems with decentralized learning.
method Proposed cooperative queues and a learning algorithm for packet rates above 1.
result Decentralized learning strategies guarantee stability in queuing systems with packet rates above 1.
dynoNet learns dynamical systems using linear operators.
problem Learning complex dynamical systems.
method dynoNet uses linear dynamical operators for sequence modeling and system identification.
result dynoNet effectively identifies systems on benchmarks.
DOODL learns shared spectral dynamics across related dynamical systems.
problem Learning independent dynamical operators for each system limits discovery of shared structure.
method DOODL learns a dictionary of characteristic spectral dynamics on a manifold of related systems.
result DOODL achieves errors one to two orders of magnitude lower than independent operator estimation methods.
Markov Chain Monte Carlo is repeatedly used to analyze the properties of intractable distributions in a convenient way. In this paper we derive conditions for geometric ergodicity of a general class of nonparametric stochastic volatility models with skewness driven by hidden Markov Chain with switching.
New method speeds up NIR spectroscopy calibration by 400x.
problem Efficient preprocessing selection in NIR spectroscopy.
method Operator-adaptive PLS and Ridge regression.
result Significant reduction in fitting time with comparable prediction quality.
New Haantjes operators extend bi-hamiltonian systems.
problem Extending bi-hamiltonian systems using recursion operators.
method Introducing Haantjes operators to generalize classical approaches.
result Family of commuting Haantjes operators replace powers of recursion operators.
Novel duality theory for operator Frobenius algebras solves long-standing hydrodynamic integrable systems problem.
problem Long-standing Eisenhart-Stäckel problem for non-degenerate integrable systems.
method Introduce duality for operator Frobenius algebras and use mutual symmetry assumption.
result Construct new infinite-dimensional integrable systems of hydrodynamic type.
Pruning CNNs by removing less important filters based on empirical loss changes.
problem Reducing memory and computation requirements for CNNs on resource-limited devices.
method Developed a novel filter importance norm based on empirical loss changes, and used sampling and ranking to prune filters.
result Reduced 60% of parameters and 64% of FLOPs with less than 0.6% accuracy drop.
Quantizes Stäckel integrable systems into self-adjoint operators.
problem Quantizing Stäckel integrable systems into self-adjoint operators.
method Constructs commutative self-adjoint operators from quadratic Hamiltonians in involution.
result Proves multiplicative separation of variables for Stäckel integrable systems.
Ringmaster LMO accelerates training in distributed systems by asynchronously updating neural networks.
problem Asynchronous training in distributed systems where workers compute gradients at different speeds.
method Introduces an asynchronous LMO-based momentum method for unconstrained stochastic nonconvex optimization.
result Establishes convergence guarantees and time complexity bounds for asynchronous LMO-based updates.
Novel flows generate molecules without post-processing.
problem Generating new molecules efficiently and without post-processing issues.
method Continuous normalizing E(3)-equivariant flows based on node ODEs coupled as a graph PDE.
result Generated samples achieve state-of-the-art performance on QM9 and ZINC250K benchmarks.
AI system synthesizes chemical plant operation procedures for efficiency and stability.
problem Developing efficient and stable operation procedures for complex chemical plants.
method Integrates automated reasoning, deep reinforcement learning, and dynamic simulation with external knowledge.
result Synthesized procedure achieves faster recovery from malfunctions compared to standard PID control.