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.

169,291 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Jan 199519922001200920182026
48 results for product optimization

Extends Gromov's optimal systolic inequality to manifolds with specific cohomology properties.

problem Finding optimal systolic inequalities for manifolds with complex cohomology structures.
method Extends Gromov's inequality to manifolds with fundamental cohomology classes as cup products of 2-dimensional classes.
result Provides an optimal systolic inequality for a new class of manifolds.

Study optimal inequality for contact CR-warped product submanifolds in cosymplectic space forms.

problem Optimal inequality for contact CR-warped product submanifolds in cosymplectic space forms.
method Using Gauss and Codazzi equations, prove an optimal inequality.
result Prove an optimal inequality for contact CR-warped product submanifolds.

Optimization method yields geometric inequalities for submanifolds in statistical warped product manifolds.

problem Optimizing geometric inequalities for submanifolds in statistical warped product manifolds.
method Optimization techniques applied to statistical submanifolds in statistical warped product manifolds.
result Optimal Casorati inequalities and Chen-Ricci inequality derived for statistical submanifolds.

New adaptive questionnaire identifies optimal product design without precise preference estimates.

problem Identifying the most profitable product design from unknown consumer preferences.
method Integrates engineering feasibility and cost models with adaptive discrete-choice questionnaire to directly determine the optimal design.
result The optimal design can be determined without accurate preference estimation, leveraging engineering knowledge.

Study optimizes product assortment for retailers with repeated exposures and patience costs.

problem Optimizing product assortment for online retailers with repeated exposures and varying consumer patience.
method Developed a cascade multinomial logit model to capture repeated exposures and patience costs.
result Proposed an approximation solution to the assortment optimization problem.

Paper proposes a new method to optimize feature coordinates for better image classification.

problem Improving feature extraction for better machine learning classification.
method Mutual-energy inner product optimization method.
result The method enhances low-frequency features and suppresses high-frequency noise, leading to better classification results.

Paper proposes efficient AL algorithms for optimizing product performance under environmental variability.

problem Optimizing product performance under varying environmental conditions.
method Formulated as Bayesian Quadrature Optimization problems for probabilistic threshold robustness measure using Gaussian Process model.
result Proposed algorithms provide credible intervals for probabilistic threshold robustness measure and demonstrate efficiency in real-world applications.

Deep sum-product networks learn faster than shallow models.

problem The speed of parameter optimization in sum-product networks.
method Theoretical analysis and empirical experiments on overparameterized sum-product networks.
result Gradient-based optimization in deep sum-product networks is equivalent to gradient ascent with adaptive and time-varying learning rates and additional momentum terms.

The paper proposes a machine learning technique to optimize prices in fashion e-commerce.

problem Optimizing prices for millions of products in fashion e-commerce to maximize revenue and profit.
method Demand prediction, price elasticity, multiple price demand pairs, linear programming optimization.
result The model improved revenue by 1% and gross margin by 0.81% in AB tests.

This work extends entropic optimal transport to non-product reference couplings, focusing on Gaussian cases.

problem Finding a diffuse coupling between two measures with non-product reference couplings.
method Reduction of the entropic optimal transport problem to a matrix optimization problem.
result Complete description of the solution for non-product reference couplings, including primal and dual variables.

This study shows the moment-SOS hierarchy converges in polynomial optimization over product of spheres.

problem Minimizing multihomogeneous polynomials over product of spheres.
method Moment-SOS hierarchy, local optimality conditions, differential geometry, Morse theory.
result The moment-SOS hierarchy has finite convergence for generic multihomogeneous objective functions.

Shampoo optimizes preconditioners for faster convergence in machine learning.

problem Improving convergence speed in machine learning optimization.
method Explicit connection between Shampoo's Kronecker product approximation and optimal matrix approximations.
result The square of Shampoo's approximation is equivalent to a single power iteration step for optimal Kronecker product approximation.

Jensen simplifies machine learning and optimization with an extensible toolkit.

problem Complex machine learning and optimization tasks in production environments.
method Develops a framework for convex functions and optimization algorithms, enabling easy deployment and extension.
result Jensen allows for quick model deployment and extension with minimal code, making machine learning accessible.

Paper evaluates how forecast errors affect optimal utilisation in production planning.

problem Forecast errors impact optimal utilisation in production planning.
method Simulation and mixed integer programming for stochastic demand.
result Forecast errors significantly affect optimal costs in production planning.

Dynamic pricing learns demand model from sparse product networks.

problem Minimizing revenue loss in a large network of products with unknown demand parameters.
method Combines optimism-in-the-face-of-uncertainty and PAC-Bayesian approaches.
result Achieves asymptotically optimal performance in terms of network size and time horizon.

The paper uses machine learning to optimize rework policies in semiconductor manufacturing.

problem Optimizing rework steps to increase yield without increasing costs.
method Applied double/debiased machine learning (DML) to estimate treatment effects.
result Derived optimal rework policies and estimated their value empirically.

Study relationships between intrinsic and extrinsic invariants of Riemannian almost k-product manifolds.

problem Find a relationship between intrinsic and extrinsic invariants of Riemannian almost k-product manifolds isometrically immersed in another Riemannian manifold.
method Establish an optimal inequality involving mixed scalar curvature and square of mean curvature.
result Optimal inequality that includes mixed scalar curvature and square of mean curvature.

Novel analysis of neural networks using geometric algebra and convex optimization.

problem Understanding the inner workings of deep neural networks.
method Geometric (Clifford) algebra and convex optimization.
result Optimal weights are given by the wedge product of training samples.

Approach to optimize bidding policies offline using reinforcement learning.

problem Optimizing spending in online advertising under budget constraints.
method Offline reinforcement learning for optimizing differentiable base policies.
result Statistically significant performance gains in production bidding environments.

A new shape space allows optimization of non-smooth shapes in fluid mechanics.

problem Optimizing non-smooth shapes in fluid mechanics.
method Constructing a product manifold to include piecewise-smooth shapes.
result Numerical results show applicability in minimizing viscous energy dissipation.

System optimizes product images for e-commerce, enhancing customer engagement.

problem Optimizing product images for e-commerce to improve customer engagement.
method Machine learning, deep learning, and computer vision techniques applied to large e-commerce catalogs.
result System produces superior image sets tailored to customer preferences.

New method for dynamic pricing with many products using low-rank demand structure.

problem Maximizing revenue in dynamic pricing with many products and evolving demand.
method Online bandit convex optimization with side information from observed demands, using low-rank structure of demand model.
result Revenue maximization approaches that of the best fixed price vector in hindsight, with rate dependent on demand model rank.

LineFlow is a framework for training RL agents to control production lines.

problem Designing control systems for production lines is challenging.
method Introduces LineFlow, an extensible Python framework for simulating and training RL agents.
result RL agents approach optimal performance in well-understood scenarios but face challenges in complex industrial lines.

We use a control framework to analyze the digital vendor's profit maximization problem. The vendor captures market share by focusing costly effort on post-launch product maintenance, which influences user perception of the product and drives a revenue stream associated with product use. Our theoretical results show nec…

2014-12-30abs ↗pdf ↗

The paper derives optimal inequalities for bi-slant submanifolds in metallic Riemannian space forms.

problem Understanding geometric properties of bi-slant submanifolds in metallic Riemannian product space forms.
method Deriving generalized Wintgen inequality, optimal inequalities involving δ-invariants, Ricci curvature, shape operator invariants, and generalized normalized δ-Casorati curvatures.
result Established optimal inequalities for bi-slant submanifolds in metallic Riemannian product space forms.

Study optimal incentives for cleaner energy production.

problem Accelerate transition to cleaner technologies in energy market.
method Stochastic control models for three scenarios: single firm, two firms, and two firms without incentives.
result Optimal strategies for investment and production emerge, highlighting firm interactions and incentive effects.

The study optimizes supply chain management through a dice-based model to predict cleaner production.

problem Uncertainty in supply chain management and economic predictions.
method A 4-component SC module (environmental, demand, economic, social uncertainties) ranked by weight, using Analytical Hierarchical Process and optimization of a weighted cost function.
result Identifies conditions validating the sustainability of a business venture and optimizes market uncertainty.

This paper optimizes product assortment decisions with changing contextual information.

problem Optimizing product assortment decisions in a dynamic context.
method Developed an upper confidence bound (UCB) policy to learn and make decisions under a changing contextual MNL model.
result Established a regret bound of O~(dT)\widetilde O(d\sqrt{T}) and a lower bound of Ω(dT/K)Ω(d\sqrt{T}/K) for dynamic assortment optimization.

WIPS optimizes inner product weights to approximate various similarities.

problem Learning high-quality node representations and accurate similarities.
method Weighted inner product similarity (WIPS) with adjustable weights.
result WIPS can approximate arbitrary general similarities including positive definite and indefinite kernels.

This paper addresses a novel data science problem, prescriptive price optimization, which derives the optimal price strategy to maximize future profit/revenue on the basis of massive predictive formulas produced by machine learning. The prescriptive price optimization first builds sales forecast formulas of multiple pr…

2016-05-18abs ↗pdf ↗

Study of Gaussian distributions using entropic Gromov-Wasserstein and inner product Gromov-Wasserstein.

problem Optimal transportation between Gaussian distributions with different dimensions.
method Entropic Gromov-Wasserstein and inner product Gromov-Wasserstein, with closed-form expressions and von Neumann's trace inequality.
result Closed-form expressions for the entropic IGW and its unbalanced variant between Gaussian distributions.

The paper proposes a method to test properties of the optimal assortment in multinomial logit models.

problem Uncertainty quantification for the optimal assortment in multinomial logit models.
method The paper proposes a novel inferential framework to test properties of the optimal assortment in multinomial logit models, reducing the problem to detecting the sign change point of marginal revenue gaps.
result The asymptotic normality of the marginal revenue gap estimator and the construction of a maximum statistic to detect the sign change point.

Paper proposes a deep learning method to forecast hydrogen consumption and optimize electrolyzer scheduling for profit maximization.

problem Optimizing electrolyzer scheduling in a dynamic power market with accurate hydrogen consumption forecasting.
method Deep learning approach for forecasting hydrogen consumption of fuel cell vehicles. Minimizing production cost by adjusting production hours based on forecasted consumption.
result Optimal electrolyzer scheduling leads to profit maximization by reducing high-cost production hours and storing sufficient hydrogen during low-cost hours.

In this paper, we initiate the study of $\p R$-warped products in para-Kähler manifolds and prove some fundamental results on such submanifolds. In particular, we establish a general optimal inequality for $\p R$-warped products in para-Kähler manifolds involving only the warping function and the second fundamental for…

2011-06-18abs ↗pdf ↗