May 25, 2022

Indiana Lawyer Profiles Faegre Drinker’s AI-X Team

In the article, “Algorithmic accountability: AI-X team at Faegre Drinker providing legal guidance in new area of law,” the Indiana Lawyer highlights the developing area of law related to algorithmic decision-making. The publication spoke to artificial intelligence and algorithmic decision-making (AI-X) team co-leaders Bennett Borden and Scott Kosnoff for insight on the sector and the recent formalization of Faegre Drinker’s AI-X team.

Borden described algorithms as the “biggest legal issue of the next decade” and noted that the use of the calculations is growing and will become heavily regulated because the outputs can impact people’s lives.

Kosnoff explained how the data that goes into an algorithm reflects societal histories and biases. “The algorithm itself is developed by humans and the outcome is often no better or worse than the input. To the extent the inputs are biased in some way, you can actually wind up with an algorithm that produces greater discrimination, not lesser discrimination,” shared Kosnoff.

Borden adds that “the concepts of algorithmic fairness are something that lawyers can become familiar with.”

The article highlights how the AI-X team is focused on helping clients in a variety of industries stay on top of emerging laws and regulations, as well as identifying and mitigating risks related to artificial intelligence and algorithms. Borden and Kosnoff share how having businesses know how their algorithms are performing will provide a best-practice model as regulators craft rules and compliance standards.

The full article is available to Indiana Lawyer subscribers.

Full Article
The Faegre Drinker Biddle & Reath LLP website uses cookies to make your browsing experience as useful as possible. In order to have the full site experience, keep cookies enabled on your web browser. By browsing our site with cookies enabled, you are agreeing to their use. Review Faegre Drinker Biddle & Reath LLP's cookies information for more details.