Research
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,695 papers · 148 categories

Trend · papers per month

336699132 · Jun 202019922001200920172026
48 results for physical feasibility

Paper introduces a method to generate physically feasible dynamics with physical priors.

problem Challenges in generating physically feasible dynamics under physical priors.
method Seamlessly incorporates physical priors into diffusion-based generative models.
result Efficient generation of physically realistic dynamics across various physical phenomena.

Develops a new framework for integrating satellite allocations in small portfolios.

problem Feasibility constraints in small portfolios, not return predictability, are the primary concerns.
method A four-layer feasibility framework: physical, economic, structural, and epistemic.
result Closed-form feasibility bounds on satellite size, turnover, and breadth without return forecasts.

SnareNet adds repair layers to neural networks to ensure outputs meet physical constraints.

problem Unconstrained neural network predictions violate physical or safety requirements.
method SnareNet appends a differentiable repair layer that navigates constraints to produce feasible outputs.
result SnareNet consistently improves objective quality while satisfying constraints more reliably.

DC3 uses deep learning to solve hard-constrained optimization problems efficiently.

problem Hard constraints in optimization problems make classical solvers slow and infeasible.
method DC3 employs a differentiable procedure to enforce feasibility and unrolls corrections for inequality constraints.
result DC3 achieves near-optimal solutions while maintaining feasibility in both synthetic and real-world tasks.

Proposes a physics-informed VAE for disentangling physics from confounding influences.

problem Challenges in inferring and predicting physical systems under partial knowledge.
method Physics-informed variational autoencoder with adversarial training.
result Model successfully disentangles known physics from confounding influences.

Solves online 3D bin packing with deep reinforcement learning under constraints.

problem Challenges of packing items immediately without information and constraints.
method Constrained deep reinforcement learning (DRL) with feasibility predictor.
result Significantly outperforms state-of-the-art methods in online 3D bin packing.

A new framework uses an Incremental Transformer to design geopolymer mixtures efficiently.

problem Designing geopolymer mixtures with limited data and physical constraints.
method Topology-aware surrogate framework guided by Incremental Transformer.
result The design space is redundant, with fewer effective mixture regimes.

Unified framework for constrained diffusion models on nonconvex sets with efficient landing mechanism.

problem Efficiently modeling generative models under nonconvex constraints.
method Unified framework with overdamped and underdamped dynamics, landing mechanism.
result Significantly reduces computational cost while maintaining sample quality.

Purely data driven approaches for machine learning present difficulties when data is scarce relative to the complexity of the model or when the model is forced to extrapolate. On the other hand, purely mechanistic approaches need to identify and specify all the interactions in the problem at hand (which may not be feas…

2011-07-13abs ↗pdf ↗

Imagine that measurements are made at times t0t_0 and t1t_1 of the trajectory of a physical system whose governing laws are given approximately by a class A{\cal A} of so-called {\em prior vector fields}. Because the physical laws are not known precisely, it might be that the measurements are not realised by the integ…

2011-04-14abs ↗pdf ↗

New method learns physical meanings in learned representations for better downstream tasks.

problem Lack of explicit physical meanings in learned representations from self-supervised learning.
method Analysis-by-synthesis approach with coordinated sampling and training.
result Trained models can control articulatory synthesizers to speak like humans and generalize well.

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.

The field of high-energy physics (HEP), along with many scientific disciplines, is currently experiencing a dramatic influx of new methodologies powered by modern machine learning techniques. Over the last few years, a growing body of HEP literature has focused on identifying promising applications of deep learning in …

2019-10-18abs ↗pdf ↗

Optimal hidden-target learning for online inventory optimization on general convex sets.

problem Online inventory optimization (OIO) on arbitrary bounded convex capacity sets.
method Maintaining a hidden target and projecting it onto the feasible order-up-to set.
result The method improves the best known regret guarantee for OIO on general convex sets from inverse to inverse-square-root dependence on the common-demand probability.

Soft-constrained PINN solves ODEs with minimal data, improving efficiency and robustness.

problem Sparse and noisy data in experiments and simulations.
method Soft-constrained Physics-informed Neural Network (PINN) with minimal labeled data.
result Soft-constrained PINN reduces need for labeled data and achieves strong generalization.

This work improves online fine-tuning of diffusion models for specific properties.

problem Efficiently fine-tuning diffusion models to maximize specific properties.
method A novel reinforcement learning procedure that efficiently explores feasible samples.
result The method provides a regret guarantee and empirical validation across multiple domains.

Recent studies show that Deep Reinforcement Learning (DRL) models are vulnerable to adversarial attacks, which attack DRL models by adding small perturbations to the observations. However, some attacks assume full availability of the victim model, and some require a huge amount of computation, making them less feasible…

2019-07-21abs ↗pdf ↗

Active researches are currently being performed to incorporate the wealth of scientific knowledge into data-driven approaches (e.g., neural networks) in order to improve the latter's effectiveness. In this study, the Theory-guided Neural Network (TgNN) is proposed for deep learning of subsurface flow. In the TgNN, as s…

2019-10-24abs ↗pdf ↗

Bayesian search optimizes exploration of feasible solutions under expensive constraints.

problem Identifying feasible solutions in computationally expensive constraint spaces.
method Bayesian models with an acquisition function for efficient exploration and exploitation.
result The proposed acquisition function improves the prediction of feasibility.

The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range constraints. Split feasibility generalizes important inverse problems including con…

2016-12-16abs ↗pdf ↗

Bayesian method improves EEG source localization and estimates skull conductivity.

problem Improving EEG source localization accuracy with unknown skull conductivity.
method Bayesian Approximation Error approach using conditional Gaussian regression, iterative optimization, and physics-informed learning.
result Clear improvements in EEG source localization accuracy and feasible estimates for unknown skull conductivity.

Data-driven discovery of "hidden physics" -- i.e., machine learning of differential equation models underlying observed data -- has recently been approached by embedding the discovery problem into a Gaussian Process regression of spatial data, treating and discovering unknown equation parameters as hyperparameters of a…

2018-08-02abs ↗pdf ↗

New algorithm exploits curvature of feasible sets for fast online convex optimization.

problem Online convex optimization with fast rates.
method Adapting FTL algorithm to curvature of feasible sets.
result Achieves logarithmic regret bound of O(ρlogT)O(ρ\log T) in stochastic environments.

Comonotonic allocations are restored under certain constraints, improving risk-sharing.

problem Feasibility constraints can distort optimal risk-sharing allocations.
method Identified componentwise convex-order solidity as a sufficient condition to restore comonotonic allocations.
result Componentwise convex-order solidity ensures comonotonic improvements under feasible constraints.

We propose a novel computational strategy for de novo design of molecules with desired properties termed ReLeaSE (Reinforcement Learning for Structural Evolution). Based on deep and reinforcement learning approaches, ReLeaSE integrates two deep neural networks - generative and predictive - that are trained separately b…

2017-11-29abs ↗pdf ↗

Investment returns naturally reside on irregular domains, however, standard multivariate portfolio optimization methods are agnostic to data structure. To this end, we investigate ways for domain knowledge to be conveniently incorporated into the analysis, by means of graphs. Next, to relax the assumption of the comple…

2019-10-12abs ↗pdf ↗

DFFL tackles federated learning with heterogeneous objectives and constraints.

problem Federated learning with clients having different objectives and feasible regions.
method Derived heterogeneity bounds for cost-vector distances and support-function/shape-distance terms. Lifted pointwise bounds to local-versus-federated excess-risk comparison.
result Federation is beneficial when the statistical advantage of pooling exceeds a client-specific heterogeneity penalty.

Study tests feasibility of linear programs with bandit feedback.

problem Testing feasibility of unknown linear programs with bandit feedback.
method Developed a novel test based on low-regret algorithms and a nonasymptotic law of iterated logarithms.
result Proved that the test is reliable and adapts to the signal level, with mean sample costs scaling as \( \widetilde{O}(d^2/Γ^2) \).

Paper defines conditions for feasible correlation matrices from factor structures.

problem Feasibility of option implied correlation matrices in non-FX markets.
method Quantitative and economic approaches to solve the nearest correlation matrix problem.
result Introduces methods to ensure feasible correlation matrices from factor structures.