Audit fees change based on company and economic factors during auditor switching.
problem Understanding how audit fees change when auditors switch firms.
method Examined the impact of auditor switching on audit fees, considering company characteristics and economic data.
result The direction and magnitude of audit fee changes during switching depend on economic stability and company characteristics.
New auditors assess f-DP privacy with adaptive sampling, avoiding large sample sizes.
problem Empirical auditing of f-DP privacy with adaptive sampling. method Shift focus to f-DP, develop adaptive auditors for whitebox and blackbox settings. result Adaptive auditors detect f-DP violations across the privacy spectrum with statistical guarantees. New fairness notion helps identify fair auditors for evaluating decision-support systems.
problem Identifying fair auditors to evaluate decision-support systems for bias.
method Introducing a non-comparative fairness notion based on desired system properties.
result The proposed fairness notion provides guarantees in terms of comparative fairness.
Corporate distress models typically only employ the numerical financial variables in the firms' annual reports. We develop a model that employs the unstructured textual data in the reports as well, namely the auditors' reports and managements' statements. Our model consists of a convolutional recurrent neural network w…
Develops a method to continuously audit black-box conditional quantile forecasts.
problem Continuous monitoring of black-box forecasts under changing data streams and regimes.
method Distribution-free and game-theoretic testing framework for non-i.i.d. losses.
result Derives finite-time detection guarantees for miscalibrated forecasts based on features.
Develops Active Fourier Auditor to estimate ML model properties without reconstructing them.
problem Verifying and auditing properties of Machine Learning models in real-world applications.
method A new framework that quantifies ML model properties using Fourier coefficients, without reconstructing the model.
result Active Fourier Auditor (AFA) is more accurate and sample-efficient than baselines for estimating robustness, individual fairness, and group fairness.
Neural networks help auditors efficiently assess financial statements by learning underlying data patterns.
problem Efficiently auditing large volumes of financial statements and journal entries.
method Vector Quantised-Variational Autoencoder (VQ-VAE) neural networks.
result VQ-VAE neural networks can learn a quantized representation of accounting data, uncovering latent factors and providing a representative audit sample.
The paper addresses fairness in online learning by extending auditing schemes and presenting efficient algorithms.
problem Ensuring fairness in online learning while maximizing predictive accuracy.
method Extending auditing schemes to handle multiple auditors and presenting oracle-efficient algorithms.
result Presented algorithms achieve upper bounds on regret and fairness violations, improving on existing bounds.
Optimizes financial auditor schedules to reduce time and costs.
problem Efficiently scheduling financial auditors with multiple constraints.
method Used Integer Linear Programming and compared two exact formulations.
result Multi-commodity network flow formulation is 24 times faster.
Machine learning models have spread to almost every area of life. They are successfully applied in biology, medicine, finance, physics, and other fields. With modern software it is easy to train even a~complex model that fits the training data and results in high accuracy on the test set. The problem arises when models…
Study online learning with individual fairness without known similarity measure.
problem Online learning with individual fairness constraints without a known similarity measure.
method Reduction to standard online classification, leveraging auditor feedback.
result Achieves sub-linear regret and fairness violations with stochastic data.
Online learning with one-sided feedback aims to maximize accuracy while ensuring fairness.
problem Maximizing accuracy in online learning with limited feedback and ensuring fairness.
method Extending the framework of Bechavod et al. (2020) to incorporate dynamic panels of auditors, reducing the problem to a contextual combinatorial semi-bandit, and leveraging Exp2 and Context-Semi-Bandit-FTPL algorithms.
result Multi-criteria no regret guarantees for accuracy and fairness are provided.
Adaptive auditing improves AI robustness testing with anytime-valid guarantees.
problem Cost and time of annotation limit rigorous AI failure mode characterization.
method Introduces hypothesis testing framework for adaptive audits using SAVI.
result Proves anytime-valid type-I error control and robustness certification.
New algorithm reduces switching costs in multinomial logit bandit problems.
problem Minimizing switching costs in multinomial logit bandit problems.
method Proposed AT-DUCB and FH-DUCB algorithms with low assortment switching costs.
result AT-DUCB and FH-DUCB algorithms achieve almost optimal minimax regret with low switching costs.
New polynomial invariants derived from birack and switch structures.
problem Polynomial invariants of braids.
method Switch structures, birack colorings, quiver-valued invariants.
result New polynomial invariants of braids.
In this paper, we study optimal switching problems under ambiguity. To characterize the optimal switching under ambiguity in the finite horizon, we use multidimensional reflected backward stochastic differential equations (multidimensional RBSDEs) and show that a value function of the optimal switching under ambiguity …
This work extends identifiability analysis to sequential latent variable models, focusing on Switching Dynamical Systems.
problem Identifying latent variables in sequential data models.
method Proved identifiability of Markov Switching Models and established conditions for Switching Dynamical Systems.
result Identifiability of latent variables and non-linear mappings in Switching Dynamical Systems up to affine transformations.
The problem of optimal switching between nonlinear autonomous subsystems is investigated in this study where the objective is not only bringing the states to close to the desired point, but also adjusting the switching pattern, in the sense of penalizing switching occurrences and assigning different preferences to util…
Study on revenue management with limited switches, achieving strong performance and reduced switch counts.
problem Resource-constrained dynamic pricing with limited switching constraints.
method Developed algorithms for blind network revenue management and bandits with knapsacks, achieving optimal regret rates.
result Optimal regret rates are fully characterized by a piecewise-constant function of the switching budget and resource constraints.
Code-switching, the alternation of languages within a conversation or utterance, is a common communicative phenomenon that occurs in multilingual communities across the world. This survey reviews computational approaches for code-switched Speech and Natural Language Processing. We motivate why processing code-switched …
New algorithms improve sampling from complex distributions.
problem Sampling from complex probability distributions efficiently.
method Regime-switching Langevin dynamics and Monte Carlo algorithms.
result Convergence guarantees and iteration complexities provided.
Squirrel switches between optimizers for better performance.
problem Finding the best optimizer for a given problem.
method Switches between different optimizers based on performance.
result Improves performance on various problems.
Study approximates financial market with discrete-time models.
problem Approximating continuous-time financial market models with discrete-time.
method Constructs discrete-time market models with Markov switching and proves convergence.
result Discrete-time models converge to continuous-time Black-Scholes model with Markov switching.
This paper studies deep learning methodologies for portfolio optimization in the US equities market. We present a novel residual switching network that can automatically sense changes in market regimes and switch between momentum and reversal predictors accordingly. The residual switching network architecture combines …
Optimizes control of hybrid systems with multiple switching processes.
problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.
Study tackles balancing policy switching costs in offline RL.
problem Balancing the cost of policy switching in offline RL.
method Optimal transport ideas and Net Actor-Critic algorithm.
result Demonstrated efficiency on multiple RL benchmarks.
New algorithm learns switching dynamics from multiple neural signals.
problem Learning accurate switching dynamical system models from multimodal neural data.
method Unsupervised learning algorithm for multiscale switching dynamical system models.
result Switching multiscale dynamical system models outperform single-scale models in behavior decoding.
Paper tackles utility maximization with job-switching and retirement constraints.
problem Maximizing utility with job-switching and retirement constraints.
method Dual-martingale approach and double obstacle problem theory.
result Characterization of optimal job-switching strategy and wealth boundaries.
Solves label switching in mixture models using optimal transport.
problem Label switching in mixture model posterior inference prevents meaningful statistics assessment.
method Proposes an algorithm leveraging optimal transport to compute posterior statistics in a quotient space.
result Demonstrates advantages over alternative approaches on simulated and real data.
New RL algorithm reduces policy switching cost to loglog(T) with similar regret.
problem Low policy switching cost in real-life RL applications.
method Stage-wise exploration and adaptive policy elimination.
result Regret of O(HSAloglogT) with O(HSAloglogT) switching cost. The paper explores dynamic regret with switching cost in online decision making.
problem The relation between dynamic regret and switching cost in online decision making.
method Investigates two classic online settings: Online Algorithms (OA) and Online Convex Optimization (OCO). Provides a new theoretical analysis framework.
result The switching cost impacts dynamic regret differently in OA and has no impact in OCO.
New method audits DP guarantees without noise or subsampling info.
problem Auditing DP guarantees of ML models without prior info.
method Histogram-based density estimation for lower bounds.
result Natural generalization of membership inference auditing.
Paper analyzes minimax regret in constrained online convex optimization with limited switching opportunities.
problem Minimizing regret in online convex optimization with limited switching opportunities.
method Introduced fugal game relaxation and mini-batching algorithm to establish minimax regret bounds.
result Minimax regret of switching-constrained OCO is Θ(T / √K).
RESHAPE explains financial statement anomalies by aggregating explanations from AENNs.
problem Detecting and explaining accounting anomalies in financial audits is challenging.
method Proposes RESHAPE to explain model output on an aggregated attribute-level.
result RESHAPE provides more comprehensible explanations compared to existing methods.
Paper presents an efficient algorithm for linear MDP with low switching cost.
problem Large state space reinforcement learning problems with low switching cost.
method First algorithm for linear MDP with low switching cost, achieving near-optimal regret and switching cost.
result Regret bound of $\widetilde{O}\left(\sqrt{d^3H^4K}
ight)$ and near-optimal switching cost of $O\left(d H\log K
ight)$.
Study strategic competition in commodity markets using impulse-switching controls.
problem Strategic competition between upstream and downstream firms in commodity markets.
method Non-zero-sum stochastic differential game with mixed impulse/switching controls.
result Multiple Nash equilibria found, depending on the number of switches by the downstream firm.
One type of switch simplifies operations on lattice knots.
problem Operations on lattice knots are complex.
method Reduced operations to one type of local switch.
result Simplified set of operations on lattice knots.
Optimal switching regret for all segmentations in online convex optimisation.
problem Non-stationary online convex optimisation problems.
method Developed an efficient algorithm to achieve optimal switching regret on every possible segmentation.
result Achieved asymptotically optimal switching regret on every possible segmentation simultaneously.
This paper tackles near-optimal adversarial RL with switching costs, providing algorithms and matching lower bounds.
problem Adversarial RL with switching costs, where loss distribution can be non-stationary or adversarial.
method Developed novel switching-reduced algorithms with matching lower bounds for known and unknown transition functions.
result Achieved near-optimal performance in adversarial RL with switching costs, matching theoretical lower bounds.
This paper addresses parameter estimation for wave equations with Markovian switching.
problem Parameter estimation for wave equations with abrupt changes.
method Bayesian statistical framework using discrete sparse Bayesian learning.
result Strong performance in parameter estimation for variable coefficient PDEs.
Algorithm for bandits with switching costs achieves optimal regret bounds.
problem Optimal regret bounds for stochastic and adversarial bandits with switching costs.
method Adaptation of Tsallis-INF algorithm with no prior knowledge of regime or time horizon.
result Achieves minimax optimal regret bounds in various settings.
In this paper, we derive the family switching formula of -n two-sphere fiber bundle embedded in a smooth four-manifold fiber bundle. In the smooth category, it is a partial generalization of Fintushel-Stern's argument for four-manifolds. We also derive an algebraic analogue of the family switching formula, allowing the…
Regime switching volatility models provide a tractable method of modelling stochastic volatility. Currently the most popular method of regime switching calibration is the Hamilton filter. We propose using the Baum-Welch algorithm, an established technique from Engineering, to calibrate regime switching models instead. …
New invariant for virtual links using multi-switches and algebraic systems.
problem Creating invariants for virtual links.
method Introducing a general approach to construct invariant algebraic systems from multi-switches and virtual links.
result Introduces a new quandle invariant for virtual links.
LaMBO optimizes modular systems with switching costs, achieving better results than existing methods.
problem Optimizing systems with costly variable updates in a sequence of modules.
method Lazy Modular Bayesian Optimization (LaMBO) that minimizes switching costs.
result LaMBO achieves vanishing regret and improves over existing cost-aware Bayesian optimization algorithms.
New algorithm reduces switching costs in RL beyond linear MDPs.
problem Costly policy switching in reinforcement learning.
method ELEANOR-LowSwitching algorithm for linear Bellman-complete MDPs.
result Achieves near-optimal regret with logarithmic switching cost.
Develops identifiability theory for multi-lag regime-switching models.
problem Ensuring interpretability of deep latent variable models with multi-lag dependencies.
method Formulates a general theoretical framework for multi-lag Regime-Switching Models (RSMs), proving identifiability of number of regimes and multi-lag transitions.
result Establishes identifiability conditions for multi-lag regime-switching models, including Markov Switching Models and Switching Dynamical Systems.
We study online learning when partial feedback information is provided following every action of the learning process, and the learner incurs switching costs for changing his actions. In this setting, the feedback information system can be represented by a graph, and previous works studied the expected regret of the le…