Defines new geodesic semilocal E-preinvex functions and studies their properties.
problem Defines new functions to generalize existing convex and preinvex concepts.
method Introduces geodesic semilocal E-preinvex functions and proves their properties.
result Establishes sufficient optimality conditions for nonlinear fractional multiobjective programming.
Paper proposes a robust method for inferring parameters in multiobjective optimization.
problem Uncertainty in hypothetical decision-making problem, data quality, and parameter space.
method Wasserstein distributionally robust approach for inverse multiobjective optimization.
result WRO-IMOP minimizes worst-case expected loss over a Wasserstein ball of distributions.
Selecting the best policy to keep the balance between what a company holds in cash and what is placed in alternative investments is by no means straightforward. We here introduce PyCaMa, a Python module for multiobjective cash management based on linear programming that allows to derive optimal policies for cash manage…
Strong geodesic convex function and strong monotone vector field of order m on Riemannian manifolds have been established. A characterization of strong geodesic convex function of order m for the continuously differentiable functions has been discussed. The relation between the solution of a new variational inequal…
Regularisation improves ML classifier stability against poisoning attacks.
problem Poisoning attacks degrade ML algorithms' performance; current attacks ignore hyperparameters.
method Proposed a multiobjective bilevel optimisation problem to consider hyperparameter effects.
result L2 regularisation enhances learning algorithm stability and mitigates poisoning attacks. The study evaluates 15 scalarizing functions in Bayesian multiobjective optimization.
problem Using scalarizing functions in computationally expensive multi- and many-objective optimization.
method 15 scalarizing functions were studied and compared using Gaussian process models and expected improvement as infill criterion.
result Different scalarizing functions have varying performance on benchmark problems with different numbers of objectives.
New method optimizes ML models under poisoned data, improving robustness.
problem Vulnerability of ML models to poisoned data attacks.
method Multiobjective bilevel optimization to consider hyperparameter learning and attack effects.
result Current approaches underestimate model robustness and regularization benefits.
New issue found in value-based reinforcement learning for stochastic environments.
problem Value-based reinforcement learning struggles with stochastic state transitions.
method Demonstrated using a multiobjective Markov Decision Process (MOMDP).
result Approaches may converge to Pareto-dominated solutions instead of optimal ones.
A new approach for efficient batch multiobjective optimization using Thompson sampling.
problem Inefficient batch multiobjective optimization due to expensive oracles and hard inner optimization.
method Proposes a Thompson sampling approach (qextttPOTS) that chooses Pareto optimal candidates sequentially. result Empirically superior performance compared to classical evolutionary approaches and MOBO.
Study solves inverse problems for equations with fractional nonlinearities.
problem Solving inverse problems for semilinear elliptic equations with fractional power nonlinearities.
method Higher order linearization method adapted for fractional order.
result Results of previous studies remain valid for general power nonlinearities.
A novel neural network approach for optimization problems.
problem Constrained optimization problems.
method Neural Optimization Machine (NOM) using a specially designed NN architecture and training procedure.
result Solves optimization problems efficiently, especially in high-dimensional spaces.
Refined theorem on linear perturbations with applications in singularity theory and optimization.
problem Linear perturbations and their implications in singularity theory and optimization.
method New perspective of Hausdorff measures for refined transversality theorem.
result Applications in singularity theory and optimization.
In this paper we present a new approach for tightening upper bounds on the partition function. Our upper bounds are based on fractional covering bounds on the entropy function, and result in a concave program to compute these bounds and a convex program to tighten them. To solve these programs effectively for general r…
The paper shows how to simplify complex optimization problems into simpler ones.
problem Complex multiobjective optimization problems.
method Proving strongly convex problems are simplicial under certain conditions and demonstrating transformations.
result Strongly convex problems can be simplified into simpler ones via generic linear perturbations.
Pareto MTL finds optimal solutions for multiple tasks with different trade-offs.
problem Finding a single optimal solution for multiple conflicting tasks.
method Formulate multi-task learning as multiobjective optimization, decompose into subproblems, solve in parallel.
result Generates well-representative Pareto optimal solutions for different trade-offs.
Convex program for estimating nonlinear recurrent models with stability conditions.
problem Estimating parameters in nonlinear recurrent models with stability conditions.
method Formulated a convex program for the estimator of nonlinear recurrent models under stability conditions.
result Sample complexity for the convex program estimator under stable dynamics.
This paper infers parameters of multiobjective decision making from noisy data.
problem Inferring parameters of multiobjective decision making from noisy data.
method Developed a data-driven inverse optimization formulation to explicitly infer parameters of a multiobjective decision making problem.
result Demonstrates strong capacity in estimating critical parameters and understanding preference distributions over multiple criteria.
Non-Markovian point process shows power-law scaling, similar to nonlinear Markovian process.
problem Understanding the scaling behavior of non-Markovian point processes.
method Analyzed a confined fractional Brownian motion-driven point process and compared it to a nonlinear Markovian process.
result A nonlinear Markovian process can reproduce the power-law scaling behavior of a non-Markovian point process.
Geometric programming approach for traffic equilibrium problems.
problem Optimizing traffic equilibrium in transportation systems.
method Finslerian dynamical model for nonlinear complementarity problems.
result Effective solution for various equilibrium problems in transportation.
Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice. A major open question is to explain why this is true. We give a natural condition under which we …
Method uses neural networks to fit nonlinear operators from data.
problem Finding nonlinear integro-differential operators from data.
method Parametrizes spatial operator with neural networks and Fourier transforms.
result Can recover spatial operators in fractional heat and Kuramoto-Sivashinsky equations.
We formulate the fractional Ricci flow theory for (pseudo) Riemannian geometries enabled with nonholonomic distributions defining fractional integro-differential structures, for non-integer dimensions. There are constructed fractional analogs of Perelman's functionals and derived the corresponding fractional evolution …
Improved RBFNN for nonlinear system identification.
problem Nonlinear system identification problem.
method Spatio-temporal extension of RBFNN with time-space orthogonality.
result Spatio-temporal RBFNN outperforms standard RBFNN in convergence and error reduction.
In order to find hyperparameters for a machine learning model, algorithms such as grid search or random search are used over the space of possible values of the models hyperparameters. These search algorithms opt the solution that minimizes a specific cost function. In language models, perplexity is one of the most pop…
Algorithm approximates regularization path for deep neural networks efficiently.
problem Computing the regularization path for high-dimensional deep neural networks.
method Multiobjective continuation method for non-smooth objectives.
result Approximation of the entire Pareto front for regularization path.
Method solves complex optimization problems with high probability bounds.
problem Nonlinear equality constrained stochastic optimization problems.
method Step-search sequential quadratic programming method.
result High-probability bound on iteration complexity for first-order stationarity.
The paper tackles lexicographic multiarmed bandit problems with bounded regret.
problem Selecting lexicographic optimal arms in multiobjective bandit problems.
method Defining lexicographic regret, considering prior information, and proposing algorithms for both settings.
result Achieves uniformly bounded regret in time for both prior settings and sublinear gap-free regret in the prior-free case.
In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization problems. The basic idea is to incorporate a local search step (gradient descent or Quasi-Newton iteration) into these uniformly optimal conv…
New method combines long-memory reservoirs for accurate dengue forecasting from short data.
problem Accurate dengue forecasting from short, noisy, non-stationary, and nonlinear data.
method Fractional ESN and Wavelet ESN frameworks integrating long-term memory.
result fESN and wESN outperform baselines in multiple dengue datasets and forecasting horizons.
In this paper we study a broad class of structured nonlinear programming (SNLP) problems. In particular, we first establish the first-order optimality conditions for them. Then we propose sequential convex programming (SCP) methods for solving them in which each iteration is obtained by solving a convex programming pro…
The goal of this paper is to encode equivalently the fractional Lagrange dynamics as a nonholonomic almost Kahler geometry. We use the fractional Caputo derivative generalized for nontrivial nonlinear connections (N-connections) originally introduced in Finsler geometry, with further developments in Lagrange and Hamilt…
Finite-time extinction and smoothing effects in fractional fast diffusion on manifolds.
problem Finite-time extinction and smoothing effects in fractional fast diffusion equations.
method Nonlinear semigroups techniques, weighted Lp spaces, fractional Green function. result Sharp extinction rates and pointwise lower bounds for solutions.
A hybrid algorithm combines optimization and enumeration for symbolic regression.
problem Finding any function from a set of operators without prior specification.
method Mixed-integer nonlinear optimization with explicit enumeration and constraints.
result The hybrid algorithm is competitive with state-of-the-art methods.
Paper derives analytical formulas for NLD-CEV moments with regime switching.
problem Analytical tractability of NLD-CEV models under stochastic regimes.
method Hybrid system approach using Feynman-Kac formula for solving interconnected PDEs.
result Exact closed-form expressions for fractional-order conditional moments.
Improved options pricing for two assets using fractional calculus.
problem Inaccurate options pricing predictions in financial markets.
method Utilized Black-Scholes equations with fractional derivatives for two asset models.
result Demonstrated analytical solution in convergent series form.
Optimizes deep learning models for ocean dynamics using Fourier neural operators.
problem Efficiently training deep learning models for ocean dynamics with optimal hyperparameters.
method Multiobjective hyperparameter optimization with DeepHyper for Fourier neural operators.
result Optimal hyperparameters significantly improved model performance in ocean dynamics forecasting.
Researchers study fractional porous medium equation on hyperbolic space.
problem Analyzing the fractional porous medium equation on hyperbolic space.
method Existence results for solutions in weak sense, using fractional Laplacian and Green's function.
result Proves different smoothing effects for solutions.
Proposes PKM for soft K-means clustering.
problem Soft K-means (m=1) unsolved since 1981.
method Probabilistic K-Means (PKM) via nonlinear programming.
result Proposed methods solve PKM efficiently.
Hybrid Bayesian MOT uses neural networks to improve model aspects, achieving state-of-the-art performance.
problem Improving multiobject tracking performance across various scenarios.
method Hybrid approach combining neural network enhancements with Bayesian estimation and belief propagation.
result State-of-the-art performance in autonomous driving dataset evaluation.
Method approximates efficient frontier of chance-constrained programs.
problem Approximating the efficient frontier of chance-constrained nonlinear programs.
method Stochastic approximation method based on bi-objective viewpoint.
result Converges to stationary solutions of a smooth approximation of the original problem.
New algorithm tackles stochastic optimization with inequality constraints.
problem Stochastic optimization with inequality constraints in various applications.
method Active-set stochastic sequential quadratic programming (StoSQP) with a differentiable exact augmented Lagrangian.
result Global convergence for any initialization, KKT residuals converge to zero almost surely.
In this paper, we study a nonlocal elliptic problem with the fractional Laplacian on Rn. We show that the problem has infinite positive solutions in Cτ(Rn)⋂Hlocα(Rn). Moreover each of these solutions tends to some positive constant limit at infinity. We extend Lin's result to the nonlocal problem on …
Paper extends a method to estimate Hurst parameter for rough stochastic volatility models.
problem Estimating Hurst parameter of rough stochastic volatility models from discrete observations.
method Extends a scale-invariant estimator to a general nonlinear function.
result Consistent estimation of Hurst parameter for a wide class of rough stochastic volatility models.
Bayesian framework for robust model discovery from noisy data.
problem Robust model discovery from noisy, sparse and irregular observations of nonlinear systems.
method Bayesian differential programming using Hamiltonian Monte Carlo and sparsity-promoting priors.
result Efficient inference of posterior distributions over plausible models with quantified uncertainty.
We discuss some of the key ideas of Perelman's proof of Poincaré's conjecture via the Hamilton program of using the Ricci flow, from the perspective of the modern theory of nonlinear partial differential equations.
Tackles variational problems with curvature and fractional Brezis-Nirenberg equations, overcoming lack of compactness.
problem Variational problems with curvature and fractional Brezis-Nirenberg equations.
method Refined techniques and Lyapunov-Schmidt method for ODE systems, blow-up analysis for elliptic equations.
result Existence and multiplicity of solutions with qualitative properties.
In this paper, we introduce a new stochastic approximation (SA) type algorithm, namely the randomized stochastic gradient (RSG) method, for solving an important class of nonlinear (possibly nonconvex) stochastic programming (SP) problems. We establish the complexity of this method for computing an approximate stationar…
Paper tackles end-to-end training of complex neural networks using DIP method.
problem Training complex heterogeneous neural network models end-to-end.
method Deep Innovation Protection (DIP) method using multiobjective optimization.
result End-to-end training of complex heterogeneous neural network models is possible.