QWYC optimizes evaluation order and thresholds to speed up ensemble classification.
problem Efficiently evaluate classifier ensembles to reduce latency and CPU usage.
method Jointly optimize evaluation order and early-stopping thresholds using a greedy algorithm.
result 4-approximation of optimal solution for certain cases, achieving significant speedup.
Second-order estimator improves continuous-time policy evaluation.
problem Estimating value surfaces from discrete data with time-inhomogeneous dynamics.
method Moment-matching coefficients for high-order generator regression.
result Second-order estimator consistently outperforms Bellman baseline.
A new first-order sampler improves diffusion probabilistic model sampling quality.
problem The belief that first-order methods are inherently slower for diffusion probabilistic model sampling.
method A novel training-free, first-order sampler that approximates the forward-value evaluation via a one-step lookahead predictor.
result The proposed sampler provably approximates the ideal forward-value trajectory while retaining first-order convergence and can improve sample quality under the same NFE budget.
New method uses noisy function evaluations for sampling Langevin diffusions.
problem Difficulty in obtaining gradient evaluations for Langevin diffusions.
method Stochastic zeroth-order discretizations of Langevin diffusions using Gaussian Stein's identities.
result Comprehensive sample complexity analysis for both overdamped and underdamped Langevin diffusions.
A computational theory reduces agent evaluation errors and speeds up processes.
problem Efficient evaluation of mini agents at reduced cost.
method Developed a computational theory and a meta-learner to handle heterogeneous agents.
result Reduced evaluation errors by 24.1% to 99.0% across various scenarios.
Paper uses ML to predict stock price movements from order book data.
problem Forecasting stock price movements in financial markets.
method Combines handcrafted and ML features for three classifiers, evaluated on two setups.
result Machine Learning shows promise for this task, suggesting future research.
Compensation methods correct overestimation of adversarial robustness in neural networks.
problem Overestimation of adversarial robustness using first-order attack methods.
method Proposed compensation methods address inaccurate gradient computation and reduce backpropagations.
result Empirical evaluation of adversarial robustness is improved with these methods.
Paper uses K-NN resampling to simulate and evaluate LOB markets.
problem Simulating and evaluating limit order book (LOB) markets.
method Applies K K K -nearest neighbor ( K K K -NN) resampling to LOB simulation and evaluation. result Demonstrates the effectiveness and efficiency of K K K -NN resampling in LOB simulation and evaluation. Mitigates bias in evaluations by considering known outcome information.
problem Bias in evaluations due to external factors like grades or acceptance.
method Formulates bias as a partial ordering, solves regularized optimization problem.
result The debiasing method improves evaluation accuracy by adapting regularization.
Paper proposes benchmarks and metrics for evaluating handwriting generation.
problem Evaluating the style of handwriting generation is challenging.
method Deep learning techniques for generating temporal sequences.
result Proposes evaluation metrics for handwriting generation.
LOB-Bench benchmarks generative AI for financial data, outperforming traditional models.
problem Lack of consensus on evaluating generative AI models for financial data.
method Python-based benchmark with LOB statistics and market impact metrics.
result Generative autoregressive models outperform traditional models in LOB data.
Certified algorithms optimize functions with varying costs, providing error bounds.
problem Optimizing functions with varying evaluation costs and error bounds.
method Formalized as a min-max game, proposed certified MFDOO algorithm with cost complexity bound.
result Proposed certified MFDOO algorithm has near-optimal cost complexity for Lipschitz functions.
Our research extends the Bilingual Evaluation Understudy (BLEU) evaluation technique for statistical machine translation to make it more adjustable and robust. We intend to adapt it to resemble human evaluation more. We perform experiments to evaluate the performance of our technique against the primary existing evalua…
New methods improve evaluation of models under varying class imbalance.
problem Optimistic evaluation metrics lead to incorrect conclusions.
method Methods focusing on evaluation under non-constant class imbalance.
result Order of classifiers can change with class imbalance rate.
This study evaluates price improvements in order flow auctions on Ethereum.
problem Improving trading outcomes in blockchain-based trading platforms.
method Utilized open-source tools to attribute price improvements to specific system inputs.
result Auction-enhanced interfaces can provide statistically significant improvements in trading outcomes, averaging 4-5 basis points.
We present and prove properties of a new offline policy evaluator for an exploration learning setting which is superior to previous evaluators. In particular, it simultaneously and correctly incorporates techniques from importance weighting, doubly robust evaluation, and nonstationary policy evaluation approaches. In a…
New Hessian estimators for Riemannian manifolds with reduced bias.
problem Estimating Hessians on Riemannian manifolds with reduced bias and computational efficiency.
method Introducing new stochastic zeroth-order Hessian estimators using O ( 1 ) O(1) O ( 1 ) function evaluations. result Achieved a bias bound of order O ( γ δ 2 ) O(γδ^2) O ( γ δ 2 ) for analytic real-valued functions. New algorithm optimizes convex functions with noisy evaluations in one dimension.
problem Optimizing convex functions with noisy zero-order evaluations in one dimension.
method Proposed a computationally efficient algorithm achieving O ( 1 / T ) O(1/\sqrt{T}) O ( 1/ T ) convergence rate. result Achieved the optimal O ( 1 / T ) O(1/\sqrt{T}) O ( 1/ T ) convergence rate, closing the gap in one dimension. This paper reviews zeroth-order optimization in signal processing and machine learning.
problem Optimization problems without gradient information.
method Iterative steps: gradient estimation, descent direction computation, solution update.
result Demonstrates applications in robustness evaluation and black-box model explanations.
We evaluate the hedging performance of a high-order compact finite difference scheme from [4] for option pricing in Bates model. We compare the scheme's hedging performance to standard finite difference methods in different examples. We observe that the new scheme outperforms a standard, second-order central finite dif…
Improves zeroth-order optimization for private machine learning with public data.
problem High computation and memory cost of first-order DP methods.
method PAZO (Public Data Assisted Zeroth-order Optimization) framework.
result Achieves superior privacy/utility tradeoffs across tasks.
New method computes affine normal directions efficiently for sparse polynomials.
problem Computing affine normal directions is computationally expensive in high dimensions.
method Reduces third-order tensor contraction to matrix-free formulation using log-determinant gradient.
result Scalable implementations with near-linear scaling in dimension and sparsity.
This article provides a novel framework to evaluate limit order tactics that highlights expected fill price, adverse price selection cost, and opportunity cost. We formulate the problem of optimal execution of market orders with nonlinear market impact, power law decay kernel, and stochastic and deterministic liquidity…
Paper discusses methods to evaluate defenses against adversarial examples.
problem Difficulty in evaluating adversarial robustness.
method Methodological foundations and best practices for evaluating defenses.
result Suggests new methods to avoid common pitfalls in evaluations.
Develops first-order methods for average-reward MDPs with strong guarantees.
problem Lack of strong theoretical guarantees for first-order methods in AMDPs.
method Average-reward stochastic policy mirror descent (SPMD) and variance-reduced temporal difference (VRTD) methods.
result Establishes sample complexity results for solving AMDPs.
DPM-Solver speeds up DPM sampling to 10-20 function evaluations.
problem Slow sampling from Diffusion Probabilistic Models (DPMs).
method Exact formulation of diffusion ODE solutions, using change-of-variable and exponentially weighted integral.
result Generates high-quality samples in 10-20 function evaluations.
Paper accelerates diffusion models without retraining, reducing evaluations.
problem Approximating target data distributions efficiently.
method Training-free sampling algorithm using high-order Lagrange interpolation.
result Requires fewer score function evaluations than previous methods.
Currently, Markov-Gibbs random field (MGRF) image models which include high-order interactions are almost always built by modelling responses of a stack of local linear filters. Actual interaction structure is specified implicitly by the filter coefficients. In contrast, we learn an explicit high-order MGRF structure b…
Paper introduces STSL, a second-order Tweedie sampler for efficient posterior sampling in inverse problems.
problem Computational challenges in sampling from posterior distributions using latent diffusion models.
method Introduces STSL, a novel second-order Tweedie sampler with tractable reverse process.
result STSL achieves 4X and 8X reduction in neural function evaluations compared to state-of-the-art solvers.
Graph neural networks are shown to be as powerful as a graph isomorphism heuristic, leading to a new approach for higher-order graph structures.
problem Understanding and distinguishing non-isomorphic graphs and their higher-order structures.
method Relating GNNs to the Weisfeiler-Leman heuristic and proposing k k k -dimensional GNNs. result GNNs have the same expressiveness as the Weisfeiler-Leman heuristic in distinguishing graphs and their higher-order structures.
We consider the problem of global optimization of an unknown non-convex smooth function with zeroth-order feedback. In this setup, an algorithm is allowed to adaptively query the underlying function at different locations and receives noisy evaluations of function values at the queried points (i.e. the algorithm has ac…
New statistical models for predicting ranked preferences from partial orders.
problem Statistical models overlook information in list length.
method Composite and augmented ranking models for joint modeling of partial orders and list lengths.
result Augmented ranking models best predict both length and preferences.
New method evaluates LLMs fairness in universal prediction.
problem Evaluating fairness of large language models in universal prediction.
method Introducing batch regret as a modification of average regret for LLMs.
result Asymptotical value of batch regret for add-constant predictors on memoryless and first-order Markov sources.
Optimizes crowdsourced preference-based subjective evaluation with online learning.
problem Large-scale evaluation of generative media using crowdsourcing due to combinatorial explosion.
method Automatic optimization of pair combination selections and evaluation volumes with online learning.
result Optimizes evaluation by reducing pair combinations and allocating optimal evaluation volumes.
New framework tests AVs as a black box, prioritizing rare failure modes.
problem Lack of rigorous and scalable testing methods for AVs.
method Developed a simulation testing framework that learns to identify and rank failure scenarios via adaptive importance-sampling methods.
result First independent evaluation of a full-stack commercial AV system (Comma AI's OpenPilot).
The paper predicts Bitcoin volatility using order flow images.
problem Predicting short-term volatility of Bitcoin prices.
method Transformed order flow data into images, trained CNN and ResNet models.
result Order flow representation with CNN achieves best performance, with RMSPE of 0.85+/-1.1.
Paper reviews and synthesizes methods for evaluating dimensionality reduction techniques.
problem Evaluating and comparing dimensionality reduction techniques.
method Framework and toolkit in R for exploring and evaluating dimensionality reduction quality through visual insights.
result Helps researchers compare and select dimensionality reduction techniques using visual insights.
The study evaluates financial risk using copulas and statistical tests.
problem Validating bivariate forecasts in risk evaluation.
method Using copulas to characterize dependencies, applying statistical tests to validate forecasts, removing heteroskedasticity.
result A Student copula accurately describes financial time series dependencies.
New metrics needed for streaming ML due to delayed labels.
problem Streaming ML evaluation fails to identify unexpected performance.
method Recommend additional metrics for streaming ML performance.
result New metrics are needed for streaming ML due to delayed labels.
Hamiltonian Monte Carlo (HMC) is a widely deployed method to sample from high-dimensional distributions in Statistics and Machine learning. HMC is known to run very efficiently in practice and its popular second-order "leapfrog" implementation has long been conjectured to run in d 1 / 4 d^{1/4} d 1/4 gradient evaluations. Here we …
Paper introduces new metrics for evaluating model accuracy.
problem Improving model accuracy and calibration.
method Developed two second-order accuracy metrics with integral and numerical representations.
result Validates model calibration settings and reveals distortions.
The paper proposes a method to evaluate ML models for subjective inference, focusing on sentence toxicity.
problem Bias in ML models for subjective inference, especially in real-life applications.
method Proposes a list of specifications to evaluate ML models for subjective inference, illustrated with a sentence toxicity example.
result Demonstrates the importance of considering subjectivity and bias in evaluating ML models.
The paper analyzes reinforcement learning methods for estimating weights and quality functions with fast convergence rates.
problem Estimating weights and quality functions in reinforcement learning with function approximation.
method The paper uses minimax methods for estimating marginal importance weights and q-functions.
result The minimax approach enables fast rates of convergence for weights and quality functions, achieving first-order efficiency.
Two new algorithms improve federated optimization under second-order similarity.
problem Federated learning under communication constraints and second-order similarity.
method SVRP and Catalyzed SVRP algorithms combining proximal point evaluations, client sampling, and variance reduction.
result Achieves superior performance and uniformly improves upon existing algorithms for federated optimization under second-order similarity and strong convexity.
ZDPG learns model-free policies without critics, improving on PG.
problem Model-free policy learning in complex dynamic problems.
method Approximates policy-reward gradients via two-point stochastic evaluations of the Q-function.
result Restores true model-free policy learning without critics, with improved stability and efficiency.
Graphs improve theorem proving in higher-order logic.
problem Challenges in converting higher-order logic formulas into graph-based representations.
method Used graph neural networks (GNNs) to represent and search higher-order logic.
result GNNs outperform state-of-the-art methods in higher-order theorem proving.
Paper offers efficient methods for nonconvex functions.
problem Minimizing smooth quasar-convex functions.
method Near-optimal accelerated gradient descent method.
result Near-optimal number of function and gradient evaluations.
We propose a method for zeroth order stochastic convex optimization that attains the suboptimality rate of O ~ ( n 7 T − 1 / 2 ) \tilde{\mathcal{O}}(n^{7}T^{-1/2}) O ~ ( n 7 T − 1/2 ) after T T T queries for a convex bounded function f : R n → R f:{\mathbb R}^n\to{\mathbb R} f : R n → R . The method is based on a random walk (the \emph{Ball Walk}) on the epigraph of the function. Th…