Houdini finds high-dimensional saddle points under few constraints.
problem Escaping from saddle points in high-dimensional spaces with constraints.
method Gradient descent methods under logarithmic inequality constraints.
result Polynomial time algorithms for escaping saddle points under constraints.
Adversarial training improves model robustness with Voronoi constraints.
problem Adversarial examples mislead machine learning models, leading to incorrect classifications.
method Geometric framework using Voronoi cells to constrain adversarial training.
result Adversarial training with Voronoi constraints produces robust models.
The paper constructs new supergravity backgrounds using specific geometric constraints.
problem Finding new supergravity backgrounds in eleven-dimensional space.
method Using twisted products of six-dimensional and five-dimensional manifolds, and analyzing the bosonic supergravity equations.
result New supergravity backgrounds appear for special cases of the adapted flux 4-form.
Additive Gaussian process framework handles monotonicity constraints in high dimensions.
problem Handling monotonicity constraints in high-dimensional data.
method Additive Gaussian process framework with MaxMod algorithm for dimension reduction.
result Framework enables to satisfy monotonicity constraints everywhere in the input space.
Paper shows affine constraint is unnecessary for high-dimensional data.
problem The necessity of an affine constraint in affine subspace clustering.
method Theoretical and empirical analysis of conditions for correctness of affine subspace clustering methods.
result Affine constraint has negligible effect on clustering performance for high-dimensional data.
Expands newsvendor model with moment constraints using Wasserstein distance.
problem Optimizing order quantity under distributional ambiguity.
method Formulates infinite dimensional primal problem, derives finite dimensional dual problem using problem of moments duality.
result Distributional ambiguity affects optimal order quantity and profits/costs.
A new VAR model with low-rank constraint for high-dimensional correlated series.
problem Predicting high-dimensional correlated series with hidden factors.
method Vector auto-regressive (VAR) model with low-rank transition matrix.
result Our method shows excellent performances on various simulated datasets and competitive/predictive in real macro-economic data.
Paper proves conditions for estimating precision matrices with Laplacian constraints.
problem Estimating high-dimensional precision matrices with Laplacian constraints.
method Minimizing Stein's loss with conditions on graph connectivity and Laplacian constraints.
result High-dimensional consistency achieved with Laplacian constraints, independent of graph structure.
A multisymplectic setting for classical field theories subjected to non-holonomic constraints is presented. The infinite dimensional setting in the space of Cauchy data is also given.
Develops methods for estimating constrained function-valued parameters in infinite-dimensional models.
problem Estimating function-valued parameters with structural constraints in complex models.
method Characterizes constrained solutions as minimizers of penalized population risk, using a Lagrange-type formulation and path through unconstrained space.
result Proposes estimators that achieve optimal risk and constraint satisfaction, applicable across various statistical learning approaches.
Some high-dimensional data.sets can be modelled by assuming that there are many different linear constraints, each of which is Frequently Approximately Satisfied (FAS) by the data. The probability of a data vector under the model is then proportional to the product of the probabilities of its constraint violations. We …
Privacy constraints affect learning Markov Random Fields differently.
problem Learning Markov Random Fields under differential privacy constraints.
method Algorithms for structure and parameter learning under pure, concentrated, and approximate differential privacy.
result Privacy constraints impose a strong separation between structure and parameter learning in high-dimensional data.
Stochastic kernel based dimensionality reduction approaches have become popular in the last decade. The central component of many of these methods is a symmetric kernel that quantifies the vicinity between pairs of data points and a kernel-induced Markov chain on the data. Typically, the Markov chain is fully specified…
One-dimensional crystals have convex shapes under certain conditions.
problem Determining if one-dimensional crystals have convex shapes.
method Analyzing the free energy under mass constraints and convexity assumptions.
result In one dimension, crystals have convex shapes under given conditions.
Spectral dimensionality reduction algorithms are widely used in numerous domains, including for recognition, segmentation, tracking and visualization. However, despite their popularity, these algorithms suffer from a major limitation known as the "repeated Eigen-directions" phenomenon. That is, many of the embedding co…
Paper solves MV portfolio selection in jump-diffusion models with no-shorting constraint.
problem Mean-variance portfolio selection in jump-diffusion model with no-shorting constraint.
method Reduces problem to LQ control and finding a maximal point of a function, constructs viscosity solution.
result Explicit viscosity solution to Hamilton-Jacobi-Bellman equation, optimal controls derived.
Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the ℓ1-norm. However, several important learning applications cannot benefit from this approach as they feature these convex norms as constraints in addition to the non-convex rank a…
The paper studies 4D Ricci flow manifolds with curvature constraints.
problem Investigating 4D Ricci flow manifolds with specific curvature conditions.
method Analyzing 4D manifolds with curvature constraints via Ricci flow.
result Proves topological and geometric gap theorems for maximal volume growth.
Physics-informed neural networks improve by measuring effective dimensionality of constraints.
problem Task interference in physics-informed neural networks due to shared parameter space.
method Introduce effective dimensionality (deff) as an operator invariant to quantify constraints. result Effective dimensionality measures unconstrained parameter directions, independent of network architecture.
Study optimizes portfolio allocation policies using off-policy data and constraints.
problem Optimizing portfolio allocation policies under constraints using off-policy data.
method Solves a minimax objective with off-policy estimators and online learning to control constraint violations.
result Constructs near-optimal allocation policies for various regimes of operation and constraints.
Develops a gradient-enhanced approach for online estimation in high-dimensional generalized linear models with streaming data.
problem Online estimation for high-dimensional generalized linear models with streaming data.
method Proposes a gradient-enhanced surrogate loss for non-distributed setting and extends to distributed streaming data.
result Derives non-asymptotic error bounds under high-dimensional scaling without batch-number constraint.
New algorithm reduces robust optimization scale for better constraint satisfaction.
problem Finding robust solutions to optimization problems with unknown constraints.
method Empirical domain reduction to determine robustness scale.
result Our algorithm's scale is less affected by parameter dimensionality.
The paper tackles physical constraints in probabilistic machine learning for CG models of high-dimensional systems.
problem Introducing physical constraints in probabilistic machine learning objectives for coarse-graining dynamical systems.
method Formulating coarse-graining process using probabilistic state-space model and accounting for constraints as virtual observables.
result Probabilistic inference tools can identify coarse-grained variables without needing a fine-to-coarse projection or time-derivatives.
Develops a framework for debiased machine learning with shape constraints.
problem Identifying and estimating parameters in high-dimensional models with endogeneity.
method General framework of identification and estimation, incorporating shape constraints.
result Identification and estimation of the Riesz representer α0 under shape constraints. Optimizes bank capital structure under Basel III constraints, simplifying complex dynamics.
problem Optimizing risky investments, dividends, and capital structure under Basel III constraints.
method Formulated as a stochastic control problem, reducing dynamics to a one-dimensional process in leverage ratio.
result Simple policy: pay dividends at an upper barrier and recapitalize at the distress boundary.
2D-PT improves sampling in constrained optimization problems.
problem Sampling Boltzmann distributions with soft constraints.
method Two-dimensional extension of parallel tempering.
result 2D-PT achieves near-ideal mixing in constrained problems.
SketchGraphs dataset aids in modeling CAD designs.
problem Training models to reason about CAD designs efficiently.
method Collection of 15 million sketches with geometric constraint graphs.
result Demonstrated use cases for generative modeling and conditional generation.
Study optimizes growth rate for investors with long-only constraints.
problem Maximizing growth rate under drift uncertainty and long-only constraints.
method Developed a finite dimensional approximation for concave functionally generated portfolios.
result Proved uniqueness and existence for optimal portfolios under long-only constraints.
Study dynamic batch learning in high-dimensional sparse linear bandits.
problem Dynamic batch learning in high-dimensional sparse linear contextual bandits under batch constraints.
method Characterized fundamental learning limits via regret lower bound and provided matching upper bound.
result Prescribed an optimal scheme for dynamic batch learning in high-dimensional sparse linear contextual bandits.
Proposes a framework to optimize complex data constraints effectively.
problem Challenges in optimizing high-dimensional, noisy data with constraints.
method Multi-stage Constrained Optimization Framework (MCOF) with EC-VAE, UT, and CPM.
result Validated on synthetic and real-world problems, achieving feasible solutions.
Paper analyzes adaptive Lasso for high-dimensional diffusion processes, improving support recovery and bias.
problem Support recovery for high-dimensional diffusion processes under sparsity constraints.
method Adaptive Lasso estimator for d-dimensional ergodic diffusion process, focusing on linear models.
result Adaptive Lasso achieves support recovery and asymptotic normality for drift parameter under certain conditions.
Solves batch policy learning with constraints using flexible meta-algorithm and OPE.
problem Efficiently use pre-collected behavior data and mediate among competing objectives and constraints.
method Flexible meta-algorithm with any batch RL and online learning subroutines, specific instantiation, and OPE method.
result Achieves strong empirical results and OPE performance in various domains, including car driving.
Develops TOFU for tensor bandits with low-rank structure.
problem Linear bandit models fail to capture high-dimensional, low-rank tensor structures.
method Develops TOFU, a tensor bandit algorithm that estimates low-dimensional subspaces and uses norm constraints.
result Improves regret bound by a multiplicative factor that grows exponentially in system order.
For certain manifolds, nonnegative Ricci curvature limits dimension and forces almost abelian fundamental group.
problem Bounding the dimension of manifolds with nonnegative Ricci curvature and specific fundamental group properties.
method Dimensional estimates for RCD(0,N) spaces with large Hausdorff dimension. result If dimension is less than 12, the fundamental group is almost abelian.
Bayesian optimization tackles constrained high-dimensional problems with penalties and trust regions.
problem Constrained optimization in high-dimensional black-box settings with expensive evaluations and complex feasibility regions.
method Penalty formulation, surrogate model, trust region strategy, Expected Improvement acquisition function.
result The proposed Trust Region method identifies high-quality feasible solutions with fewer evaluations and maintains stable performance.
Spatially constrained Gaussian mixture models reduce covariance complexity.
problem High dimensionality in finite mixture models for spatial data.
method Spatial covariance constraint with only four free parameters.
result Improves clustering of multi-way spatial data and inference of spatial patterns.
Study properties of 3D almost η-Ricci solitons with diagonal metrics.
problem Characterize 3D almost η-Ricci solitons with diagonal metrics.
method Analyzes manifold properties under specific assumptions and constraints.
result Determines potential vector field and constraints on the metric.
Framework learns stochastic dynamics from endpoint and intermediate distributions using soft energy constraints.
problem Learning stochastic dynamics from endpoint and intermediate distributional observations.
method Formulates generation as a McKean-Vlasov control problem with soft energy constraints, solving it through FBSDE.
result Model learns coherent stochastic trajectories matching prescribed marginal laws.
NMF with specific constraints is equivalent to LDA.
problem Dimensionality reduction of non-negative data.
method NMF with ℓ1 normalization constraints and Dirichlet prior. result NMF with these constraints is equivalent to LDA.
In this paper we study a class of physical systems that combine a finite number of mechanical and thermodynamic observables. We call them finite dimensional thermo-mechanical systems. We introduce these systems by means of simple examples. The evolution equations of the involved observables are obtained in each example…
Study on surfaces in Heisenberg group with constant mean curvature.
problem Constant mean curvature surfaces in the Heisenberg group.
method Proves surfaces in a neighborhood of non-umbilic points are solutions to a sinh-Gordon equation with a differential constraint.
result Surfaces in Heisenberg group with constant mean curvature described by solutions to sinh-Gordon equation.
Study of four-dimensional Lorentzian manifolds with real Killing spinors.
problem Characterizing and understanding four-dimensional Lorentzian manifolds with Killing spinors.
method Differential geometry and topology, Killing spinor equations, flow equations.
result Proves that the evolution flow defined by a real Killing spinor preserves the Hamiltonian and momentum constraints of the Einstein equation with negative curvature.
We consider the minimization of submodular functions subject to ordering constraints. We show that this optimization problem can be cast as a convex optimization problem on a space of uni-dimensional measures, with ordering constraints corresponding to first-order stochastic dominance. We propose new discretization sch…
The estimation of multivariate GARCH time series models is a difficult task mainly due to the significant overparameterization exhibited by the problem and usually referred to as the "curse of dimensionality". For example, in the case of the VEC family, the number of parameters involved in the model grows as a polynomi…
We consider the problem of Graphical lasso with an additional ℓ∞ element-wise norm constraint on the precision matrix. This problem has applications in high-dimensional covariance decomposition such as in \citep{Janzamin-12}. We propose an ADMM algorithm to solve this problem. We also use a continuation st…
Estimates population size using capture-recapture designs with binary indicators.
problem Estimating population size from capture-recapture data with binary indicators.
method Proposes a modern method using undersmoothed lasso model to estimate the target parameter of interest.
result The choice of constraint on the K-dimensional distribution significantly impacts the value of the estimand.
The paper explores infinite-dimensional nonholonomic and vakonomic systems.
problem Understanding dynamics of infinite-dimensional systems with constraints.
method Visualizing and revisiting classical and new examples of nonholonomic and vakonomic systems.
result Infinite-dimensional systems exhibit both nonholonomic and vakonomic dynamics.
Aims to optimize complex multivariate systems with constraints.
problem Optimizing force-field systems in physics with large-scale simulations.
method Combines machine learning and experimental design to find feasible input combinations.
result Locates multiple good regions in the input space.