A new method predicts stock ranking uncertainty to improve trading performance during regime shifts.
problem Ranking models fail during regime shifts, leading to suboptimal performance.
method Adapting DEUP to rankers, predicting rank displacement and uncertainty, and proposing a two-level deployment policy.
result The two-level deployment policy improves risk-adjusted performance and indicates DEUP adds value mainly as a tail-risk guard.
This work improves interpretability in deep learning models by introducing a two-level concept discovery framework.
problem High complexity and lack of interpretability in deep learning models, especially for safety-critical tasks.
method Concept Bottleneck Models (CBMs) framework combining vision-language models and data-driven coarse-to-fine concept selection.
result The proposed framework outperforms recent CBM approaches and provides a principled interpretability.
This paper shows how path spaces on two-level manifolds can be Hilbert manifold structures.
problem Addressing the structure of path spaces on two-level manifolds.
method Introducing the notion of tameness and constructing charts on path spaces of two-level manifolds.
result Path spaces on tame two-level manifolds have the structure of a Hilbert manifold.
HyperSAGE learns node representations in hypergraphs without losing information.
problem Learning node representations in hypergraphs is complex due to higher-order relations.
method Two-level neural message passing strategy for accurate information propagation.
result HyperSAGE outperforms state-of-the-art methods on benchmark datasets.
Method learns representation invariant to subgroup support using adversarial matching.
problem Representational bias in training data leads to spurious correlations.
method Adversarial support-matching using semi-supervised clustering.
result Improves generalizability to unseen sources.
Recently, over-parameterized neural networks have been extensively analyzed in the literature. However, the previous studies cannot satisfactorily explain why fully trained neural networks are successful in practice. In this paper, we present a new theoretical framework for analyzing over-parameterized neural networks …
This work analyzes generalization in federated learning using information theory.
problem Generalization performance in federated learning is less explored compared to centralized learning.
method The work applies an information-theoretic analysis via the conditional mutual information (CMI) framework to study federated learning's two-level generalization.
result The work derives multiple CMI-based bounds, including hypothesis-based CMI bounds and fast-rate evaluated CMI bounds, which improve convergence rates for specific model aggregation strategies and structured loss functions.
As a contribution to interpretable machine learning research, we develop a novel optimization framework for learning accurate and sparse two-level Boolean rules. We consider rules in both conjunctive normal form (AND-of-ORs) and disjunctive normal form (OR-of-ANDs). A principled objective function is proposed to trade …
Fast BATLLNN speeds up verification of TLL NNs by 400x.
problem Verifying output constraints for TLL NNs.
method Uses TLL architecture and decoupled box constraints to improve verification performance.
result 400x faster than state-of-the-art verifiers.
Develops a two-level monotonic multistage recommender system for better user-specific prediction.
problem Leveraging user-item-stage dependencies in a monotonic chain of events for enhanced prediction accuracy.
method A multistage recommender system with a two-level monotonic property, using a large-margin classifier based on a nonnegative additive latent factor model.
result The proposed method outperforms existing methods in simulations and an article sharing dataset.
LARF improves random forests with attention mechanisms and contamination models.
problem Improving accuracy in classification tasks with random forests.
method Introduces a two-level attention mechanism and uses a mixture of contamination models.
result Significantly improved classification performance on various datasets.
Paper tackles performative prediction without convexity assumptions.
problem Performative prediction where data distribution changes with model deployment.
method Reparameterization framework to transform non-convex objective into convex one.
result Provably sublinear regret guarantees for learnable model.
Paper develops efficient algorithms for robust optimization across multiple groups.
problem Minimizing maximal empirical risk across distinct groups in robust optimization.
method Develops ALEG and ALEM algorithms for two-level finite-sum convex-concave minimax optimization.
result Achieves ε-accuracy with complexity O(m√(nlnm/ε)) and outperforms state-of-the-art methods.
New NN design for nonlinear systems control with guarantees.
problem Designing NN architectures for nonlinear system control with guarantees.
method Exploits system model to design NN architecture, uses TLL NN for approximation.
result Guaranteed NN architecture sufficient for implementing a controller.
In Maslov (2003), a two level model of the occurrence of financial pyramid (bubbles) has been considered. We also considered the mathematical analogy of this model to Bose condensation. In the present paper, we explain why Ponzi schemes and bubbles result in a crisis in real economics. In Maslov (2005), the law of incr…
Deployment-complete benchmarking assesses if evidence leads to consistent deployment actions.
problem Lack of clear evidence leading to consistent deployment actions.
method Introduces deployment-complete benchmarking to test if benchmark evidence determines deployment actions.
result Benchmark evidence must be complete for a claim to lead to a consistent deployment action.
This paper examines the valuation of American capped call options with two-level caps. The structure of the immediate exercise region is significantly more complex than in the classical case with constant cap. When the cap grows over time, making extensive use of probabilistic arguments and local time, we show that the…
Paper establishes lower bounds and optimal algorithms for deployment-efficient RL.
problem Deployment efficiency in reinforcement learning.
method Optimization with constraints, lower bounds, algorithms.
result Established optimal algorithms for deployment-efficient RL.
DUPLE tackles cross-deployment recognition in fiber-optic perimeter security with meta-learning.
problem Cross-deployment recognition challenges in fiber-optic perimeter security due to label scarcity and distribution shifts.
method DUPLE employs statistically guided meta-learning to enhance recognition robustness across unseen deployments.
result DUPLE consistently outperforms traditional and meta-learning baselines in cross-deployment DFOS benchmarks.
Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that UCB, M3, S or Exp3 algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on predi…
Machine learning (ML), especially deep learning is made possible by the availability of big data, enormous compute power and, often overlooked, development tools or frameworks. As the algorithms become mature and efficient, more and more ML inference is moving out of datacenters/cloud and deployed on edge devices. This…
We study the quantum synchronization between a pair of two-level systems inside two coupled cavities. By using a digital-analog decomposition of the master equation that rules the system dynamics, we show that this approach leads to quantum synchronization between both two-level systems. Moreover, we can identify in th…
Nonlinear optimal control problems are often solved with numerical methods that require knowledge of system's dynamics which may be difficult to infer, and that carry a large computational cost associated with iterative calculations. We present a novel neurobiologically inspired hierarchical learning framework, Reinfor…
Framework for responsible LLM deployment with human involvement and decentralized technologies.
problem Challenges in deploying LLMs for high-stakes decisions, including data security and accountability.
method Interactive human involvement through multiple iterations, decentralized technologies, and automated auditing.
result Enhanced security and accountability in LLM deployment for financial decisions.
The stochastic variational inference (SVI) paradigm, which combines variational inference, natural gradients, and stochastic updates, was recently proposed for large-scale data analysis in conjugate Bayesian models and demonstrated to be effective in several problems. This paper studies a family of Bayesian latent vari…
A method for quickly determining deployment schedules that meet a given fuel cycle demand is presented here. This algorithm is fast enough to perform in situ within low-fidelity fuel cycle simulators. It uses Gaussian process regression models to predict the production curve as a function of time and the number of depl…
The paper develops methods to reduce deployment risk under dynamic covariate shifts.
problem Reduction of deployment risk under dynamic covariate shifts.
method Time-domain Poincare inequality and Jacobian-velocity theorem to identify and control directional tangent energy.
result Drift-aligned tangent regularization (DTR) reduces risk volatility and directional gain in low-rank drift regimes.
New multi-spiral approach improves packaging of thick membranes.
problem Deploying thick membranes on curved surfaces efficiently.
method Multi-spiral folding approach with prismatic folding lines.
result Improved deployment performance of thick membranes on curved surfaces.
Analysis of over-parameterized neural networks has drawn significant attention in recentyears. It was shown that such systems behave like convex systems under various restrictedsettings, such as for two-level neural networks, and when learning is only restricted locally inthe so-called neural tangent kernel space aroun…
RL research overhypes potential but lacks deployable solutions.
problem Current RL research overhypes potential and lacks deployable solutions.
method Identifies and critiques current RL research practices.
result Current RL research direction is unlikely to lead to practical, economically viable solutions.
MLDemon monitors ML systems post-deployment, improving reliability with real-time performance estimates and expert labels.
problem Ensuring reliability of machine learning systems post-deployment, especially when user inputs differ from training data.
method Integrates unlabeled and on-demand labeled data to monitor ML model performance in real-time, deciding when to acquire expert labels.
result Outperforms existing approaches in temporal datasets with diverse distribution drifts, providing theoretical optimality for distribution drifts.
Survey of challenges and future directions in applying RL to real-world settings.
problem Challenges in deploying RL in practical settings due to limited interaction and changing environments.
method Analysis of RL system design, implementation, and continual improvement.
result Need for theory and methodology to bridge research and application gap.
CSA fills a gap in RLVR-trained LLM deployment by providing anytime-valid selective risk control.
problem Deployment of RLVR-trained LLMs in regulated organizations requires a safety certificate for every round without waiting for long-run averages.
method CSA uses a (test statistic, validity guarantee, deployment rule) framework to fill the gap, maintaining a Ville-type e-process per threshold on a Bonferroni grid.
result CSA provides the first anytime-valid selective risk control for RLVR-trained LLMs, matching the long-run average certification rate and satisfying pathwise validity and non-refusing deployment on every cell.
BREMEN optimizes policies offline with fewer data, achieving efficient deployment.
problem High cost of updating policies in real-world applications.
method Behavior-Regularized Model-ENsemble (BREMEN) algorithm for offline optimization.
result BREMEN achieves impressive deployment efficiency with 5-10 deployments, outperforming standard RL methods.
Algometrics analyzes how predictive models affect their own forecasts in algorithmic markets.
problem How predictive models affect their own forecasts in algorithmic markets.
method Introduces algometrics, a framework for time series with feedback, proving three results on deployment risk.
result Deployment risk cannot be identified from passive historical data alone, and historical rankings can invert under crowding.
New RL algorithm reduces deployment cost for linear function approximations.
problem Efficiently deploying new policies in RL with unknown rewards.
method Proposes an algorithm that minimizes trajectories needed for identifying optimal policies.
result Achieves optimal deployment complexity and sample complexity.
To answer the existence of optimal swimmer learning/teaching strategies, this work introduces a two-level clustering in order to analyze temporal dynamics of motor learning in breaststroke swimming. Each level have been performed through Sparse Fisher-EM, a unsupervised framework which can be applied efficiently on lar…
A2SGD reduces distributed SGD communication to O(1) per worker.
problem Heavy communication costs in distributed SGD for large models.
method Two-level gradient averaging to consolidate gradients to two local averages.
result Achieves O(1) communication complexity per worker, significantly reducing traffic and training time.
Next generation of embedded Information and Communication Technology (ICT) systems are collaborative systems able to perform autonomous tasks. The remarkable expansion of the embedded ICT market, together with the rise and breakthroughs of Artificial Intelligence (AI), have put the focus on the Edge as it stands as one…
Automated framework optimizes DNN deployment on Arm CPUs.
problem Lack of globally optimised DNN deployment across software levels.
method Reinforcement Learning search for automated design space exploration.
result Up to 4x improvement in performance and 2x reduction in memory.
Operations is a key challenge in the domain of machine learning pipeline deployments involving monitoring and management of real-time prediction quality. Typically, metrics like accuracy, RMSE etc., are used to track the performance of models in deployment. However, these metrics cannot be calculated in production due …
The paper designs neural networks with assurance for controlling nonlinear systems.
problem Designing neural networks with assurance for nonlinear system control.
method Bounding the number of affine functions needed for a CPWA function, connecting it to a TLL NN architecture.
result The TLL NN architecture is parameterized by the number of affine functions in the CPWA function it realizes.
NEMO framework quantizes DNNs for efficient deployment.
problem Efficient deployment of quantized DNNs.
method Formal framework for quantizing DNN layers, focusing on IntegerDeployable representation.
result Quantized DNNs can be deployed using only integers.
Self-supervised policy adapts after deployment without rewards.
problem Generalizing reinforcement learning policies across different environments.
method Uses self-supervision to train policies in new environments without reward signals.
result Significant improvements in generalization across diverse environments.
Paper explores generalization of AID-based bi-level optimization methods.
problem Uncertainty in generalization properties of AID-based bi-level optimization methods.
method Uniform stability analysis and convergence study of AID-based methods.
result AID-based methods can achieve similar generalization as single-level nonconvex problems.
Orpheus simplifies deep learning deployment on edge devices.
problem Optimizing deep learning inference on edge devices for efficiency.
method Orpheus is a new framework with a small codebase, minimal dependencies, and easy integration.
result Preliminary results show the effectiveness of Orpheus for inference optimisations.
Distillation is an effective knowledge-transfer technique that uses predicted distributions of a powerful teacher model as soft targets to train a less-parameterized student model. A pre-trained high capacity teacher, however, is not always available. Recently proposed online variants use the aggregated intermediate pr…
Specialized Deep Learning (DL) acceleration stacks, designed for a specific set of frameworks, model architectures, operators, and data types, offer the allure of high performance while sacrificing flexibility. Changes in algorithms, models, operators, or numerical systems threaten the viability of specialized hardware…