E2CM uses class means for efficient early exits in neural networks.
problem Efficient early exits in neural networks with low computational cost.
method Early Exit Class Means (E2CM) based on class means of samples, without gradient-based training. result E2CM achieves higher accuracy with fixed training time budget and boosts existing early exit schemes. Enhances early-exit neural networks for anytime classification.
problem Lack of guaranteed prediction quality improvement with longer computation time.
method Post-hoc modification based on Product-of-Experts to enforce conditional monotonicity.
result Achieves conditional monotonicity in prediction quality, enabling anytime classification.
Risk control improves EENNs to make faster predictions without sacrificing accuracy.
problem Determining safe times for EENNs to exit early without degrading performance.
method Adapting risk control frameworks to EENNs to tune their exiting mechanism.
result Risk control enables EENNs to make faster predictions while maintaining user-specified performance goals.
EERO optimizes resource usage for efficient classification.
problem Managing computational resources in complex machine learning models.
method EERO uses multiple classifiers with a reject option to adaptively shorten processing paths.
result EERO effectively manages budget allocation and enhances accuracy in complex scenarios.
The paper accelerates LLM inference by adding early exit heads trained in a self-supervised manner.
problem Inference speed in large language models (LLMs) is slow and resource-intensive.
method Adding self-supervised early exit heads at intermediate transformer layers to stop computation early based on confidence thresholds.
result Entropy provides the most reliable confidence metric for stopping computation early.
EENNs improve inference efficiency but need nested prediction sets for reliable uncertainty estimates.
problem Non-nested prediction sets from standard uncertainty quantification methods in EENNs.
method Introduced anytime-valid confidence sequences (AVCSs) tailored for EENNs.
result AVCSs generate nested prediction sets across EENN exits, addressing the issue of non-nested sets.
This paper introduces early exits in neural networks for faster inference.
problem Reducing inference time and preventing overfitting in neural networks.
method Designing and training multi-output neural networks with early exits.
result Significant reductions in inference time and improved robustness.
ELF improves long-tailed classification by focusing on hard examples.
problem Overfitting to majority classes in long-tailed data distributions.
method EARLY-exiting Framework with auxiliary branches.
result Improves accuracy by more than 3 percent on ImageNet LT and iNaturalist'18.
Energy-efficient DL inference for IoT devices reduces power consumption and improves performance.
problem Energy inefficiency in deep learning models for IoT devices.
method Energy-aware early exiting policy to balance energy consumption and inference accuracy.
result Accuracy and service rate improved up to 25% and 35% respectively.
SIFT reduces training time by selecting samples with approximate losses.
problem Reducing training time by selecting samples with large approximate losses.
method Developed SIFT which uses early exiting to obtain approximate losses with intermediate layer representations for sample selection.
result SIFT achieves significant gains in training time and number of backpropagation steps without optimized implementation.
A hybrid neural network optimizes AI deployment on edge and cloud for energy efficiency.
problem Energy and resource constraints in edge devices for deep learning models.
method Conditionally deep hybrid neural network with quantized layers at edge and full-precision layers at cloud.
result Early classification at the edge reduces energy consumption by 5.5x on CIFAR-10 dataset.
Ensembling multiple predictions is a widely used technique for improving the accuracy of various machine learning tasks. One obvious drawback of ensembling is its higher execution cost during inference. In this paper, we first describe our insights on the relationship between the probability of prediction and the effec…
We present an approach to adaptively utilize deep neural networks in order to reduce the evaluation time on new examples without loss of accuracy. Rather than attempting to redesign or approximate existing networks, we propose two schemes that adaptively utilize networks. We first pose an adaptive network evaluation sc…
This paper improves self-play learning in games by manipulating experience distributions.
problem Improving self-play learning in games through better experience sampling.
method Three approaches: weighted sampling, Prioritized Experience Replay, and diversifying trajectories.
result Major improvements in early training performance in some games, minor improvements overall.
Understanding the community conditions that best support universal access and improved childhood outcomes allows ultimately to improve decision-making in the areas of planning and investment across the early stages of childhood development. Here we describe two different data-driven approaches to visualizing the lived …
Deep RL model optimizes pedestrian evacuation in multi-exit scenarios.
problem Optimizing pedestrian evacuation in multi-exit indoor environments.
method MultiExit-DRL using Deep Reinforcement Learning with DQN and DNN.
result MultiExit-DRL reduces evacuation frames and optimizes exit utilization.
Study of a generalized geometric Brownian motion with varying entry and exit rates.
problem Understanding the long-run behavior of economic systems with growth, volatility, entry, and exit.
method Generalized geometric Brownian motion framework with varying entry and exit rates, analyzing moments and survival probability.
result Optimal exit rate minimizes mean first-passage time, influencing system outcome.
Analyzes first exit times in a modified Barndorff-Nielsen and Shephard model.
problem Analyzing first exit times in a modified Barndorff-Nielsen and Shephard model.
method Formulated an approximate model driven by Brownian motion and Lévy subordinator, analyzed first exit times of log-return process.
result First exit time process decomposes into Brownian motion and Lévy subordinator components.
Study uses LLMs to optimize VC exit timing after IPO.
problem Optimal exit timing after IPO is crucial but not well studied.
method Uses LLMs to analyze financial data and market signals.
result LLMs can improve VC exit timing and generate better returns.
Study examines strategic exit timing in uncertain competition.
problem Timing of strategic exit decisions in competitive markets with uncertainty.
method Constructs a stochastic game equilibrium for exit strategies involving state variable and posterior belief process.
result Unique equilibrium found for symmetric Bayesian players.
Enhances KANs for accuracy and interpretability with multi-exit architecture.
problem Unclear optimal depth for KANs and difficulty in optimization and interpretation.
method Introduces multi-exit KANs with each layer having its own prediction branch.
result Multi-exit KANs outperform single-exit versions on various datasets.
This work optimizes DNN inference for energy-harvesting devices by compressing and selectively executing neural network exits.
problem Inference delays and energy inefficiency in energy-harvesting devices.
method Developed a power trace-aware and exit-guided network compression algorithm for multi-exit neural networks.
result Superior accuracy and reduced latency compared to state-of-the-art techniques.
New method controls mean exit time in stochastic systems using machine learning and quasipotential.
problem Controlling mean exit time in stochastic dynamical systems with white noise.
method Developed a neural network to compute the quasipotential function and designed an algorithm to calculate the controller.
result Effective and accurate control strategy demonstrated through numerical experiments.
Previous work in hierarchical reinforcement learning has faced a dilemma: either ignore the values of different possible exit states from a subroutine, thereby risking suboptimal behavior, or represent those values explicitly thereby incurring a possibly large representation cost because exit values refer to nonlocal a…
This research examines relationship between staging of Venture Capital (VC) investments and social feedback visible in publicly available data on the Web. We address the question of Venture Capital investment sensitivity to performance and prospects of new venture, given as likelihood of obtaining future financing, ava…
Unified ML approach for SDEs in bounded domains.
problem Challenges in simulating SDEs with particle exit phenomena.
method Hybrid approach combining diffusion model and exit prediction network.
result Accurate modeling of interior dynamics and boundary interactions.
Paper analyzes venture capital exit decisions under inconsistent preferences.
problem Time-inconsistent preferences in venture capital exit timing.
method Modeling four types of venture capitalists with varying levels of inconsistency.
result Time-inconsistent venture capitalists exit earlier than consistent ones.
Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal submanifolds of N×R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fund…
This paper employs the extrinsic information transfer (EXIT) method, a technique imported from the analysis of the iterative decoding of error control codes, to study the performance of belief propagation in community detection in the presence of side information. We consider both the detection of a single (hidden) com…
The purpose of this article is to compute the expected first exit times of Brownian motion from a variety of domains in the Euclidean plane and in the hyperbolic plane.
Developed policy gradient methods for stochastic control with exit time, outperforming traditional techniques in share repurchase pricing.
problem Optimal control with exit time in stochastic models.
method Two types of algorithms: direct policy learning and alternately learning value function and control.
result Policy gradient methods outperform PDE or neural networks in share repurchase pricing.
We prove explicit upper and lower bounds for the L1-moment spectra for the Brownian motion exit time from extrinsic metric balls of submanifolds Pm in ambient Riemannian spaces Nn. We assume that P and N both have controlled radial curvatures (mean curvature and sectional curvature, respectively) as view…
AdaEnsemble learns adaptive feature interactions for CTR prediction.
problem Learning feature interactions for CTR prediction in recommender systems and Ads ranking.
method AdaEnsemble is a Sparsely-Gated Mixture-of-Experts (SparseMoE) architecture that dynamically selects feature interaction depth.
result AdaEnsemble achieves better prediction accuracy and inference efficiency compared to state-of-the-art models.
AdaPID optimizes diffusion-based samplers by dynamically adjusting schedules.
problem Optimizing the intermediate-time dynamics in diffusion-based samplers.
method Develops a time-varying stiffness schedule using Piece-Wise-Constant (PWC) parametrizations and a hierarchical refinement approach.
result QoS-driven PWC schedules consistently improve sampling fidelity and accuracy.
Study shows submanifolds can't be immersed in certain spaces.
problem Non-immersibility of submanifolds with infinite mean exit time.
method Not based on the weak maximum principle at infinity, generalizes previous results.
result Estimates for complete tower of moments for submanifolds with small mean curvature.
Investors optimize liquid staking decisions in LSP and AMM protocols.
problem Optimal timing and allocation in liquid staking protocols.
method Derive optimal allocation strategy and model optimal exit timing using Laplace transforms and free-boundary techniques.
result Optimal stop-loss strategy maximizes expected payoff, influenced by fees and opportunity gains.
This paper investigates sufficient conditions for a Feynman-Kac functional up to an exit time to be the generalized viscosity solution of a Dirichlet problem. The key ingredient is to find out the continuity of exit operator under Skorokhod topology, which reveals the intrinsic connection between overfitting Dirichlet …
Mean exit times concentrate near equators and minimal hypersurfaces in high dimensions.
problem Understanding mean exit times on spheres and manifolds.
method Analyzing Brownian motion on spheres and manifolds with minimal hypersurfaces.
result Mean exit times concentrate near equators and minimal hypersurfaces in high dimensions.
Even in the face of deteriorating and highly volatile demand, firms often invest in, rather than discard, aging technologies. In order to study this phenomenon, we model the firm's profit stream as a Brownian motion with negative drift. At each point in time, the firm can continue operations, or it can stop and exit th…
We apply the theory of continuous time random walks to study some aspects of the extreme value problem applied to financial time series. We focus our attention on extreme times, specifically the mean exit time and the mean first-passage time. We set the general equations for these extremes and evaluate the mean exit ti…
In the domain of technology startups, biotechnology has often been considered as specific. Their unique technology content, the type of founders and managers they have, the amount of venture capital they raise, the time it takes them to reach an exit as well as the technology clusters they belong to are seen as such un…
Optimizes liquidity withdrawal timing for AMM LPs to balance fees and impermanent loss.
problem Balancing fees and impermanent loss in automated market makers.
method Stochastic control problem with endogenous stopping time, numerical solutions via Euler scheme and Longstaff-Schwartz method.
result Optimal exit strategy depends on volatility, fees, and market dynamics.
Optimal exit strategies of CPT gamblers in unfair gambles
problem Optimal exit strategies of gamblers with CPT preferences in games with strictly negative expected payoffs
method Formulating the problem as an optimal stopping problem on asymmetric random walks, applying geometric transformation, randomized strategies, and changing the decision variable
result The unfair problem in the infinite time horizon has finite values for a wide range of CPT parameter specifications
Study predicts startup outcomes like funding, patenting, IPOs using machine learning.
problem Forecasting startup success metrics like funding, patenting, IPOs.
method Developed interpretable machine learning framework, used preprocessing, class imbalance handling, and compared multiple models.
result Achieved high AUROC values for patent, funding, and exit predictions.
This paper proposes and analyses a new multilevel Monte Carlo method for the estimation of mean exit times for multi-dimensional Brownian diffusions, and associated functionals which correspond to solutions to high-dimensional parabolic PDEs through the Feynman-Kac formula. In particular, it is proved that the complexi…
We study theoretical and empirical aspects of the mean exit time of financial time series. The theoretical modeling is done within the framework of continuous time random walk. We empirically verify that the mean exit time follows a quadratic scaling law and it has associated a pre-factor which is specific to the analy…
In this paper we develop a statistical arbitrage trading strategy with two key elements in hi-frequency trading: stop-loss and leverage. We consider, as in Bertram (2009), a mean-reverting process for the security price with proportional transaction costs; we show how to introduce stop-loss and leverage in an optimal t…
The paper explores conditions for compactness and finiteness in stratified homotopy theory.
problem Conditions for compactness and finiteness in stratified homotopy theory.
method Analyzes conditions for compactness and finiteness in stratified homotopy theory, providing sufficient conditions and deducing results.
result Conditions for compactness and finiteness in stratified homotopy theory are established.