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

200400600800 · Jun 202019922001200920172026
48 results for optimization ease

EASE optimizes exemplar selection for ICL in LLMs efficiently.

problem Efficiently selecting exemplars for in-context learning (ICL) in large language models (LLMs).
method EASE uses neural bandit algorithms to optimize exemplar sets, considering both exemplar ordering and instruction.
result EASE outperforms existing methods in finding optimal exemplar sets for all test queries.

Meta-learning balances task-specific modeling and optimization complexity.

problem Balancing accurate task-specific modeling with ease of optimization in meta-learning.
method Theoretical and empirical analysis of trade-off between modeling and optimization in meta-learning.
result Explicit bounds on modeling and optimization errors for non-convex and linear regression problems.

We consider the linear regression problem under semi-supervised settings wherein the available data typically consists of: (i) a small or moderate sized 'labeled' data, and (ii) a much larger sized 'unlabeled' data. Such data arises naturally from settings where the outcome, unlike the covariates, is expensive to obtai…

2017-01-17abs ↗pdf ↗

In agreement with the recent research findings in the econophysics, we propose that the nonlinear dynamic chaos can be generated by the turbulent capital flows in both the quantitative easing transmission channels and the transaction networks channels, when there are the laminar turbulent capital flows transitions in t…

2013-05-24abs ↗pdf ↗

Study creates a global living index to assess quality of life.

problem Long-term impacts of global economic changes on living conditions.
method Machine learning framework combining socio-economic factors.
result Developed a practical tool for policymakers to identify areas needing improvement.

Auto-Surprise automates recommender system selection and optimization.

problem Finding the best algorithm and hyperparameters for recommender systems.
method Extends Surprise library with TPE optimization for algorithm selection and hyperparameter tuning.
result Significantly faster in finding optimal hyperparameters compared to grid search.

Stable neural flows ensure robustness and efficiency in deep learning.

problem Ensuring robustness and stability in deep learning models.
method Introducing a stable variant of neural ODEs with a neural network parametrizing an energy functional, solving as an optimal control problem with adjoint sensitivity analysis.
result The proposed model provides robustness against input perturbations and low computational burden.

We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric app…

2016-07-18abs ↗pdf ↗

EASE estimator improves probabilistic value estimation efficiency.

problem Efficiently estimating probabilistic values like Shapley and semivalues.
method Developed an Efficiency-Aware Surrogate-adjusted Estimator (EASE) that minimizes first-order mean squared error.
result EASE consistently outperforms existing estimators for various probabilistic values.

Selecting an optimal set of icons is a crucial step in the pipeline of visual design to structure and navigate through content. However, designing the icons sets is usually a difficult task for which expert knowledge is required. In this work, to ease the process of icon set selection to the users, we propose a similar…

2019-02-01abs ↗pdf ↗

Enhanced Gaussian process models accelerate optimization and posterior approximation.

problem Improving the accuracy and speed of Gaussian process models for optimization and inference.
method Introduces a random exploration step to classical GP-UCB algorithms, facilitating faster convergence.
result New algorithms achieve nearly optimal convergence rates and provide bounds for Hellinger distance.

Latent Gaussian models (LGMs) are widely used in statistics and machine learning. Bayesian inference in non-conjugate LGMs is difficult due to intractable integrals involving the Gaussian prior and non-conjugate likelihoods. Algorithms based on variational Gaussian (VG) approximations are widely employed since they str…

2013-06-05abs ↗pdf ↗

Bayesian attention modules improve model interpretability and performance.

problem Deterministic attention modules limit model interpretability and optimization.
method Proposes a scalable stochastic attention module using simplex-constrained distributions and Bayesian learning.
result Consistent improvements over baselines in various attention-based models.

A new noise model for preferential Bayesian optimization using user anchors.

problem Inadequate assumption of homoscedastic noise in human-in-the-loop settings.
method Proposes a heteroscedastic noise model with anchors and a KDE uncertainty map.
result Risk-adjusted performance improvement and clarified anchor placement effects.

Develops a fast variational approximation for high-dimensional empirical Bayes posteriors.

problem Optimal posterior computation in high-dimensional settings with prior tails effect.
method Variational approximation of empirical Bayes posterior with data-driven centers and thin-tailed conjugate priors.
result Retains optimal concentration rate properties and superior performance compared to existing methods.

We present POLO --- a C++ library for large-scale parallel optimization research that emphasizes ease-of-use, flexibility and efficiency in algorithm design. It uses multiple inheritance and template programming to decompose algorithms into essential policies and facilitate code reuse. With its clear separation between…

2018-10-08abs ↗pdf ↗

A toolkit for path-norms enhances neural network generalization bounds.

problem Establishing generalization bounds for modern neural networks.
method Introducing a comprehensive toolkit for path-norms in ReLU networks with various operations.
result Established generalization bounds for modern neural networks that are the most widely applicable and recover/beat the sharpest known bounds.

Framework optimizes model performance and interpretability for tabular data.

problem Balancing model performance and interpretability in machine learning models.
method Model-agnostic multi-objective optimization framework with evolutionary algorithm.
result Framework generates diverse models that trade off performance and interpretability efficiently.

Triadic-OCD detects changes in data streams robustly and optimally, even in asynchronous settings.

problem Online change detection in data streams with practical constraints.
method Triadic-OCD framework for asynchronous online change detection with provable robustness, optimality, and convergence.
result The proposed triadic-OCD algorithm achieves optimal performance and convergence in asynchronous settings.

The recent use of `Big Code' with state-of-the-art deep learning methods offers promising avenues to ease program source code writing and correction. As a first step towards automatic code repair, we implemented a graph neural network model that predicts token types for Javascript programs. The predictions achieve an a…

2019-05-16abs ↗pdf ↗

A new decision tree induction method using MIP for faster optimization.

problem Optimizing decision tree split rules for better classification performance.
method Mixed-integer programming (MIP) for Gini reduction maximization, efficient search algorithm.
result bsnsing trees outperform other tree models in new case discrimination.

New method uses optimal transport to improve conformal prediction under distribution shifts.

problem Improving conformal prediction's coverage in non-exchangeable settings.
method Optimal transport to estimate and mitigate distribution shifts.
result Estimates and mitigates loss in coverage for arbitrary distribution shifts.

PAIR optimizes machine learning models to generalize better to out-of-distribution data.

problem Optimization of machine learning models for out-of-distribution (OOD) generalization often leads to compromises that weaken robustness.
method Introduces a multi-objective optimization (MOO) perspective and a new optimization scheme called PAreto Invariant Risk Minimization (PAIR).
result PAIR improves robustness of OOD objectives by cooperatively optimizing with other objectives, yielding top OOD performances.

Enhances MOT with causality constraints for better option pricing.

problem Limited applicability of traditional martingale optimal transport (MOT) for option pricing.
method Integrates causality constraints into MOT and proposes McCormick relaxations for computational tractability.
result Empirically, McCormick MOT yields significant price reductions for basket and digital options compared to classic MOT.

State-of-the-art machine learning frameworks support a wide variety of design features to enable a flexible machine learning programming interface and to ease the programmability burden on machine learning developers. Identifying and using a performance-optimal setting in feature-rich frameworks, however, involves a no…

2019-08-13abs ↗pdf ↗

The increasing volume of short texts generated on social media sites, such as Twitter or Facebook, creates a great demand for effective and efficient topic modeling approaches. While latent Dirichlet allocation (LDA) can be applied, it is not optimal due to its weakness in handling short texts with fast-changing topics…

2013-01-24abs ↗pdf ↗

Alternating Direction Method of Multipliers (ADMM) has become a widely used optimization method for convex problems, particularly in the context of data mining in which large optimization problems are often encountered. ADMM has several desirable properties, including the ability to decompose large problems into smalle…

2019-07-10abs ↗pdf ↗