Surveying nonparametric inference with shape constraints, past and future.
problem Statistical inference under shape constraints.
method Historical overview and future directions.
result Outlook on future research directions.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,932 papers · 148 categories
Trend · papers per month
48 results for “directional constraints”
The constraints arising from DAG models with latent variables can be naturally represented by means of acyclic directed mixed graphs (ADMGs). Such graphs contain directed and bidirected arrows, and contain no directed cycles. DAGs with latent variables imply independence constraints in the distribution resulting from a…
This work presents entropic constraints from DAGs with hidden variables.
problem Characterizing causal relations in systems with hidden variables.
method Entropic inequality constraints derived from -separation relations.
result These constraints can learn about true causal models from observed data.
Chance-constrained ActInf allows for small violations of constraints to drive goal-directed behavior.
problem Goal-directed behavior constrained by prior beliefs.
method Introducing chance constraints to ActInf, allowing for small violations of constraints.
result Chance-constrained ActInf allows for a trade-off between robust control and chance constraint violation.
Beyond Reverse KL: Generalizing Direct Preference Optimization with Diverse Divergence Constraintscs.LG
This paper introduces -DPO, a generalized approach to Direct Preference Optimization using diverse divergence constraints.
problem Aligning large language models with human preferences while mitigating safety risks.
method Incorporates diverse divergence constraints to simplify the relationship between reward and optimal policy, eliminating the need for estimating the normalizing constant.
result Optimizes LLMs to align with human preferences more efficiently and under a broader set of divergence constraints.
New method learns DAGs from data without acyclicity constraint.
problem Learning DAGs from data without imposing acyclicity.
method Sparse matrix factorization and -penalized optimization.
result Empirical success in recovering true graphs and almost-DAG graphs.
This dissertation uses ILP to learn Bayesian network structures efficiently.
problem Learning the structure of Bayesian networks from data.
method Integer Linear Programming formulation with cluster constraints and cutting planes.
result The approach finds feasible solutions for Bayesian network structures efficiently.
Develops a new method for learning non-parametric DAGs using RKHS.
problem Challenges of learning non-parametric causal models with large combinatorial search space.
method Uses reproducing kernel Hilbert spaces (RKHS) and sparsity-inducing regularization terms based on partial derivatives to enforce acyclicity.
result Shows improved performance through simulations and data analyses.
Identification of causal direction between a causal-effect pair from observed data has recently attracted much attention. Various methods based on functional causal models have been proposed to solve this problem, by assuming the causal process satisfies some (structural) constraints and showing that the reverse direct…
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.
ALIAS uses RL to learn DAGs without acyclicity constraints.
problem Efficiently learning DAGs from observational data without acyclicity constraints.
method ALIAS employs RL to generate DAGs in a single step with optimal complexity, bypassing acyclicity constraints.
result ALIAS outperforms state-of-the-art methods in causal discovery.
This paper presents a method to summarize directed graphs while preserving edge information.
problem Summarizing directed graphs while maintaining edge directionality.
method A model based on minimizing reconstruction error with non-negative constraints, related to Max-Cut criterion, using multiplicative update algorithms.
result The proposed method identifies compressed nodes and directed compressed relations, providing a more accurate representation of directed graphs.
The characteristic gluing problem for the Einstein vacuum equations. Linear and non-linear analysisgr-qc
Solves Einstein vacuum equations gluing problem for close Minkowski data.
problem Solving the characteristic gluing problem for Einstein vacuum equations.
method Derived infinite-dimensional and 10-dimensional gauge-dependent and gauge-invariant charges; constructed null lapse function and conformal geometry.
result Obstructions to gluing problem are gauge-dependent charges, modulo gauge-invariant charges.
New method improves interpretability of text adversarial examples.
problem Generating interpretable adversarial examples in text is challenging.
method Sparse Projected Gradient Descent (SPGD) with directional and sparsity constraints.
result Improves interpretability and likelihood of adversarial examples compared to state-of-the-art methods.
Novel approach for SEM in small samples with .
problem Small sample size and issues in factor-based SEM.
method Reformulates covariance structure into self-covariance and cross-covariance, defines a feasible set with relative error constraint.
result Improved stability and directional information in small-sample settings.
A lending scheme for a system of interconnected banks with probabilistic constraints of failureq-fin.MF
We derive a closed form solution for an optimal control problem related to an interbank lending schemes subject to terminal probability constraints on the failure of banks which are interconnected through a financial network. The derived solution applies to a real banks network by obtaining a general solution when the …
Auto-conditioned primal-dual hybrid gradient method and alternating direction method of multipliersmath.OC
New methods solve saddle point problems without line search.
problem Solving saddle point problems efficiently and adaptively.
method Auto-conditioned primal-dual hybrid gradient (AC-PDHG) and auto-conditioned ADMM (AC-ADMM) methods.
result Methods achieve optimal complexity and convergence guarantees.
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…
A new ML method teaches constraints directly to models.
problem Addressing safety and fairness in AI systems.
method Directly teaching constraint satisfaction to ML models using a constraint solver.
result Empirically, our approach performs well on fairness and synthetic constraints.
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 number of discrete and continuous optimization problems in machine learning are related to convex minimization problems under submodular constraints. In this paper, we deal with a submodular function with a directed graph structure, and we show that a wide range of convex optimization problems under submodular constr…
Study examines how EU's Value at Risk constraints affect insurance oligopolies.
problem Impact of EU's Value at Risk constraints on insurance oligopolies.
method Bertrand model with profit-maximizing companies facing Value at Risk constraints.
result Value at Risk constraints can lead to monopolistic premiums or market failure.
Unknown constraints arise in many types of expensive black-box optimization problems. Several methods have been proposed recently for performing Bayesian optimization with constraints, based on the expected improvement (EI) heuristic. However, EI can lead to pathologies when used with constraints. For example, in the c…
Study risk aggregation with order constraint under unknown dependence.
problem Risk aggregation with an order constraint under uncertainty.
method Introduced DL coupling for concave order risk aggregation, generalized to tail risk measures.
result Analytical formulas for bounds on Value-at-Risk with improved accuracy.
We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot of attention in the Big Data context. Although it has been invented decades ago…
FedSGM tackles constrained federated learning with unified framework.
problem Functional constraints, communication bottlenecks, local updates, and partial client participation in federated learning.
method Unified framework based on switching gradient method, incorporating bi-directional error feedback, and soft switching for stability.
result Achieves convergence rate with high-probability bounds decoupling from sampling noise.
Hybrid QAOA approach optimizes portfolios with strict constraints, outperforming classical methods.
problem Combinatorial optimization under strict cardinality constraints in portfolio management.
method Constraint-preserving QAOA with XY-mixers and Trotterized initialization.
result QAOA achieves a Sharpe Ratio of 1.81, significantly outperforming classical methods.
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 () as an operator invariant to quantify constraints.
result Effective dimensionality measures unconstrained parameter directions, independent of network architecture.
Study on relativistic nonholonomic mechanics with time-dependent constraints.
problem Formulating classical time-dependent nonholonomic mechanics.
method Invariant formulation using moving frames and Chaplygin systems.
result Hamiltonization of time-dependent constraints achieved.
Paper proposes an algorithm for PARAFAC2-based CMTF models with various constraints.
problem Jointly analyze matrices and tensors with irregular/ragged data.
method Alternating Optimization (AO) and ADMM for fitting PARAFAC2-based CMTF models with various constraints.
result Accurately recovers underlying patterns using various constraints and linear couplings.
We propose a mixed integer programming (MIP) model and iterative algorithms based on topological orders to solve optimization problems with acyclic constraints on a directed graph. The proposed MIP model has a significantly lower number of constraints compared to popular MIP models based on cycle elimination constraint…
Proposes methods to add constraints to neural networks to improve stability and generalization.
problem Improving stability and generalization of neural networks.
method Constraint-based regularization using stochastic gradient Langevin dynamics.
result Constraints help stabilize and improve the robustness of deep neural networks.
Unifying DAGs and UGsstat.ML
We introduce a new class of graphical models that generalizes Lauritzen-Wermuth-Frydenberg chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to two edges are allowed between any pair of nodes. Specifically, we present local, pairwise and global Marko…
Study shows directional convergence for neural networks under spherical symmetry.
problem Learning linear predictors with neural networks under spherically symmetric data.
method Analysis of gradient flow and gradient descent for two-layer and deep linear networks.
result Directional convergence guarantees with exact convergence rate for specific network architectures.
When the vacuum Einstein equations are cast in the form of hamiltonian evolution equations, the initial data lie in the cotangent bundle of the manifold MΣ of riemannian metrics on a Cauchy hypersurface Σ. As in every lagrangian field theory with symmetries, the initial data must satisfy constraints. But, unlike those …
Policy gradient algorithms typically combine discounted future rewards with an estimated value function, to compute the direction and magnitude of parameter updates. However, for most Reinforcement Learning tasks, humans can provide additional insight to constrain the policy learning. We introduce a general method to i…
MINTS uses a minimalist Bayesian framework to tackle multi-armed bandits with structural constraints.
problem Sequential decision-making under uncertainty with complex structural constraints.
method Minimalist Bayesian framework with profile likelihood to eliminate nuisance parameters.
result MINTS achieves near-optimal regret guarantees and adapts to unimodal structure.
This paper addresses identifiability issues in HLAMs with hierarchical constraints.
problem Identifiability of HLAMs with hierarchical constraints.
method Developed sufficient and necessary identifiability conditions.
result Characterizes impacts of different attribute types in the graph on identifiability.
Unified clustering model handles both pairwise and cardinality constraints for better performance.
problem Clustering with specific constraints (pairwise and cardinality) to improve clustering quality.
method Unified integer programming formulation, binary and quadratic constraints, reformulated as continuous constraints, solved using ADMM.
result Unified model outperforms single category constraints and achieves better clustering performance.
A Flexible Optimization Framework for Regularized Matrix-Tensor Factorizations with Linear Couplingscs.LG
Flexible framework for CMTF with ADMM for various constraints and couplings.
problem Challenges in data fusion from multiple sources with varying characteristics.
method Flexible algorithmic framework using AO and ADMM for various constraints, loss functions, and couplings.
result Accurate and computationally efficient results for various loss functions, including KL divergence.
A new penalty-free method optimizes portfolios without quantum annealing penalties.
problem Optimizing portfolios with quantum annealing penalties.
method Removing the penalty term and using a classical feasibility projector.
result Significant reduction in chain-break fractions and post-processed regret.
We consider the problem of learning Bayesian network classifiers that maximize the marginover a set of classification variables. We find that this problem is harder for Bayesian networks than for undirected graphical models like maximum margin Markov networks. The main difficulty is that the parameters in a Bayesian ne…
We study smooth complex hypersurfaces in direct products of closed hyperbolic Riemann surfaces and give a classification in terms of their fundamental groups. This answers a question of Delzant and Gromov on subvarieties of products of Riemann surfaces in the smooth codimension one case. We also answer Delzant and Grom…
The paper proposes a probabilistic autoencoder for discovering causal directions between variables.
problem Finding the causal direction between two associated variables.
method Building an autoencoder of the joint distribution and maximizing its estimation capacity relative to marginal distributions.
result The higher estimation capacity is consistent with the unconstrained choice of a distribution representing the cause, while the lower capacity reflects the constraints imposed by the mechanism on the distribution of the effect.
Despite a lack of theoretical understanding, deep neural networks have achieved unparalleled performance in a wide range of applications. On the other hand, shallow representation learning with component analysis is associated with rich intuition and theory, but smaller capacity often limits its usefulness. To bridge t…
OLLA framework efficiently samples from constrained distributions with nonconvex constraints.
problem Sampling from constrained distributions with nonconvex constraints is challenging.
method Overdamped Langevin with Landing (OLLA) framework that handles both equality and inequality constraints.
result OLLA converges exponentially fast to the constrained target density in distance.
New DAG constraints improve differentiable DAG learning.
problem Recovering DAG structures from observational data is hard due to combinatorial optimization.
method Developed analytic functions to formulate DAG constraints, closed under differentiation, summation, and multiplication.
result Analytic DAG constraints outperform previous methods in various settings.
A new method for predicting uncertainties in stream networks.
problem Uncertainty quantification in spatiotemporal graphs with directional flow constraints.
method Spatio-Temporal Adaptive Conformal Inference (STACI) integrating network topology and temporal dynamics.
result STACI effectively balances prediction efficiency and coverage, outperforming existing methods.